For the following problems stated as pseudo-code, let All...rl denote the sublist of the integer list A from the 6-th to the r-th element inclusive, let Foo(A[i...n) denote an algorithm that runs in time On"), and let Bar (A[l...n) denote an algorithm that runs in time on login). Algo (A[i...n) If ns5 Then Return // nothing to do Foo(A[i...nl) Algo (A[... ] Bar(A[1... nl) Algo (AILE... 1) Foo(A[l... nl) Algo (AL)...nl) Bar (All...n) End Algo. (2 points) 1. State a recurrence that gives the complexity T(n) for algorithm Algo. (3 points) 2. Find the tight complexity of algorithm Algo. Flex(A[i...n) If ns. Then Return // nothing to do Foo(All...n) Flex (A[l... In/211) For i=1 to n do Bar (A[l... 1 1 End For Flex(A[l... In/211) End Flex (2 points) 3. State a recurrence that gives the complexity Tin) for algorithm Flex. (3 points) 4. Find the tight complexity of algorithm Flex. For the following problems stated as pseudo-code, let All...rl denote the sublist of the integer list A from the 6-th to the r-th element inclusive, let Foo(A[i...n) denote an algorithm that runs in time On"), and let Bar (A[l...n) denote an algorithm that runs in time on login). Algo (A[i...n) If ns5 Then Return // nothing to do Foo(A[i...nl) Algo (A[... ] Bar(A[1... nl) Algo (AILE... 1) Foo(A[l... nl) Algo (AL)...nl) Bar (All...n) End Algo. (2 points) 1. State a recurrence that gives the complexity T(n) for algorithm Algo. (3 points) 2. Find the tight complexity of algorithm Algo. Flex(A[i...n) If ns. Then Return // nothing to do Foo(All...n) Flex (A[l... In/211) For i=1 to n do Bar (A[l... 1 1 End For Flex(A[l... In/211) End Flex (2 points) 3. State a recurrence that gives the complexity Tin) for algorithm Flex. (3 points) 4. Find the tight complexity of algorithm Flex