7. Given an array of integers 40, 5, 66. 38, 11, 13, 16 and choosing the last element of the array as a pivot, perform partitioning procedure of the QuickSort algorithm. Find: (a) (3 points) the first swap: (b) (3 points) the last swap: (c) (3 points) the number of swaps; (d) (3 points) the rearranged array