Please give answers in detail, thank you

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[l...n]) If n s5 Then Return // nothing to do Foo(A[1...n]) Algo (A[1... 135]]) Bar (A[1...n]) Algo (A[LE]... 149 ]]) Foo(A[1...n]) Algo (ALL)) ...n]) Bar (A[1...n]) End Algo. 6. (2 points) State a recurrence that gives the complexity T(n) for algorithm 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