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(nlogn). Algo (A[l...n]) If ns5 Then Return // nothing to do Foo(A[1... n]) Algo (A[i... 131 Bar(A[l... n]) Algo (A[L]... 14?]]) Foo (A[1...n]) Algo (ALL)...n) Bar (A[l... n]) End Algo. 6. (2 points) State a recurrence that gives the complexity T(n) for algorithm Algo