Please help me out all of those questions, thanks

5. Suppose that you have a linear time "partition" algorithm that always divides a list in two parts such that: All the elements in the first part are smaller than all the elements in the second one, and . The largest part always has at most 60% of the elements of the original array. (a) Write a RECURSIVE algorithm that finds the k-th smallest element and that USES the "partition" algorithm given above. (b) Write a recurrence relation for the worst-case running time of your algorithm. (c) Does this agorithm work in worst case linear time? 5. Suppose that you have a linear time "partition" algorithm that always divides a list in two parts such that: All the elements in the first part are smaller than all the elements in the second one, and . The largest part always has at most 60% of the elements of the original array. (a) Write a RECURSIVE algorithm that finds the k-th smallest element and that USES the "partition" algorithm given above. (b) Write a recurrence relation for the worst-case running time of your algorithm. (c) Does this agorithm work in worst case linear time