PPls help asap solving this problem with details

==C Problem 3. (9 points) 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[e] with A[i] = a. (2 points) Give a formal statement about what algorithm Fool does. b. (3 points) 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. c. (4 points) Analyze the running time of algorithm Fool and write a recurrence relation to describe it. Solve this recurrence relation to give a tight bound (using O notation) on the running time. Distinguish worst-case and best-case running time if necessary