This is Java Programming! Please show all work neat and legibly. Due in 30 minutes!!

6) Assume that we are using quick sort algorithm to sort the following elements in the array 26, 15, 30,11,8,7 22, 40, 4, 10. Use the first element in the array as pivot. (20 pts.) 1-How total iterations it would take to complete the sorting proces? 2- Simulate the entire sorting process. (If you need additional space, complete it at the other side of the paper) public static void quick sort(int[] a, int left, int right) f if (left