) Assume that we are using quick sort algorithm to sort the following elements in the array 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 process? 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)( if (left right) int j partition(a, left, right)s quick sort(a, left, j 1): quick_sort(a,+1, right); Total iterations