4: For quicksort algorithm, we sometimes use median-of- 3 method for finding the pivot. In this method pivot is the median of a set of 3 elements chosen randomly from three distinct indices. Say, pi is the probability that the element of rank-i is chosen as a median. Provide an exact formula of pi in terms of n, which is the size of the array (you can assume that all values in the given array is distinct)