1. (20 points) Professor Jones has proposed a new sorting algorithm (pseudocode is given below) Jones_Sort (A, i, j) //swap element i with element j if (i+)2 j return Jones_Sort (A, i, j-k) Jones_Sort (A, itk, j) Jones_Sort (A, i, j-k) //first two-thirds //last two-thirds //first two-thirds again 1(a). (5 points) If A L]-[6, 3, 2, 5, show the array after each swap when Jones_Sort(A, 0, 3) is called 1(b). (10 points) Determine the worst-case time complexity of Jones_Sort() using 00) notation in terms of the size of the array, n