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[l...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[1...n]) If ns5 Then Return // nothing to do Foo (A[1...n]) Algo(A[1... [ 39 ]]) Bar (A[l...n]) Algo (AL)...***1) Foo (A[...n]) Algo (A[129] ... n]) Bar (A[l...n]) End Algo. 8. (2 points) State a recurrence that gives the complexity T(n) for algorithm Flex