please show all steps for a and b

1. Assume that you are given a black-box algorithm (which means you can use this algorithm directly, but you do not know how it is implemented) Median (A[pr]) that can return the median element (which is the [2rp]th smallest element) in array A[pr] within linear time. a. Given an array A of size n, present pseudo-code of a simple, efficient algorithm that uses this algorithm Median (A[pr]) as a subroutine to find the ith smallest element in the array; in other words, present a different version of algorithm SELECT (A,i). (Hint: You can use median as the pivot to partition an array now.) b. Show that you algorithm has worst-case time complexity (n)