For the following problems stated as pseudo-code, let A[l... r) denote the sublist of the integer list A from the l-th to the r-th element inclusive, let Foo(A[1... n]) denote an algo- rithm that runs in time O(n?), and let Bar(A[1... n]) denote an algorithm that runs in time O(nlog n). Algo (A[l...n]) If ns5 Then Return // nothing to do Foo(A[1...n]) Algo(A[1... [ 3 ]]). Bar (A[l...n]) Algo(A[LI]... Lymp]]) Foo (A[l...n]) Algo (A[ 21 ] ... n)) Bar (A[l...n]) End Algo. 7. (3 points) Find the tight complexity of algorithm Algo. NB: If you use the Master Theorem, you will be docked points if you fail to justify its application as indicated before. Flex(A[1...n]) If ns1 Then Return // nothing to do Foo (A[l... n)) Flex(A[1... [n[V2]]) For i =1 to n do Bar (A[1... [29]]) End For Flex(A[1... In/V2]]) End Flex