1. Give a formal statement about what algorithm Foo1 does. 2. Analyze the running time of algorithm Foo2 and give a tight bound (using notation) on it. Distinguish worst-case and best-case running time if necessary. 3. Analyze the running time of algorithm Foo1 and write a recurrence relation to describe it. Solve this recurrence relation to give a tight bound (using notation) on the running time. Distinguish worst-case and best-case running time if necessary.

==C Assume we have a linear time (O(n)-time) algorithm LINEAR-SELECT(A, l, r, i) that takes an array A with indices l, r, with 1 x Fool(A, s +1,r) i=i+1 swap A[i] with A[j] swap A[@] with A[i] 2 = 2