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.