(A v B) ^ ~(~A ^ B) → A

Please help with the following in C

write a C++ function to compute the following (Set Theory)       a.   std::vector<int> intersection(std::vector<int>& a, std::vector<int>& b)       b.   std::vector<int> union(std::vector<int>& a, std::vector<int>& b)       c.  std::vector<int> abs_complement(std::vector<int>& u, std::vector<int>& a, std::vector<int>& b)        d. std::vector<int> relative_complement(std::vector<int>& u, std::vector<int>& a, std::vector<int>& b)  //a\b       e. std::vector<int> delta_diff(std::vector<int>& u, std::vector<int>& a, std::vector<int>& b)  //a = { x, y, z ... } void print(std::vector<int>& v, std::string& n) { std::vector<int>::iterator itr = std::begin(v); for (; itr != std::end(v); itr++) {    std::cout<<(*itr)<<std::endl; } }   int main(int avgc, char** avgs)  {  std::vector<int> u = {1, 2, 3,…

Q5) A function foo has been analyzed to run with O(n2) complexity to process a list of size n.Assuming this function takes 6 seconds to process a list of size 100, how many seconds would you expect it to take to for this function to process a list of size 200?