Here is an array which has just been partitioned by the first step of quicksort: 16 13 8 24 4 28 48 36 66 54 64 72 102 96 78 a) Which of these elements could have been the pivot in this first step? If there are more than one possibility, show each possible element. b) Considering your answer in (a), perform the second step of quicksort using Hoare's partitioning algorithm we discussed in class (pivot is the first key among the relevant key sequence)! If there is more than one correct answer in (a) then use the largest one