3) If the nums array is initially [8, 4, 5, 7, 1, 6, 2, 3, 0], do the following: a. Give the mergeSort call-return diagram, including the following: al. Number the calls, starting with 0. a2. out to the right of each call, show the subarray that the call receives and the 2 smaller subarrays that it breaks up this subarray into. a3. Next to the return arrow for each call, show the sorted subarray that the call returns. a4. In a circle to the left of each call, give the number of comparisons (of 2 elements of the nums array) that the call does while merging the 2 smaller sorted subarrays b. Give the order in which the calls return: c. Give the call numbers at each recursion level: Recursion Level Call Numbers