its a java algorithm question its urgent thank you

Sorting 4. (6 points) a) We are sorting the below numbers by using quicksort algorithm. If we complete the first partition operation by choosing a pivot randomly, which statements could be true? Set: {7, 10, 6, 12, 14, 17, 16, 15) The pivot could be either the 12 or the 14. The pivot could be the 12, but it is not the 14. The pivot is not the 12, but it could be the 14. Neither the 7 nor the 9 is the pivot. b) Consider you are given an array of elements arr[5]= {7,6,5,4,3}, and you are asked to sort the array in ascending order. What are the steps of insertions done while doing insertion sort in the array? Show each major intermediate step in your