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 (n), and let Bar (A[1... n]) denote an algorithm that runs in time O(nlog? n). Algo (A[1...n]) If ns5 Then Return // nothing to do Foo (A[i...n]) Algo(A[1... [ 34 ]]) Bar(A[l...n]) Algo (A[la]... 14?]]) Foo (A[l...n]) Algo (A[129]...n]) Bar(A[1... n]) End Algo. Flex(A[l...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... [2]]). End For Flex(A[1... In/V2]]) End Flex. 9. (3 points) Find the tight complexity of algorithm Flex. NB: If you use the Master Theorem, you will be docked points if you fail to justify its application as indicated before