Problem 2. Explain what operations the following C++ function (myfunction) does. Under what scenarios, will the function experience the worst-case performance? What is the worst case time complexity with respect to N (defined as N = e-b+1)? To better read the code, you can relate b to begin, e to end, low to lower_index, u to upper_index, , and e1 to temp_e. Note that the function argument v is a vector of int, and is passed by reference. Hint: You can try "vector v= {4, 3, 7, 11, 2, 6,5};" to have a basic idea of the function. void my function(vector &v, int b, int e) { if (b == e) return; int low = b, u = e; int el = e; int templ = v[b], temp2; for (int k = b + 1; k 1)) myfunction(v, b, low - 1); if ((e - u >1)) myfunction(v, u + 1, e); return