Problem 2: Mergesort 6 points; 2 points for each part,; individual-only Put all of your work for this problem in a plain-text file named ps5pr2.txt. Given the following array: 124, 3, 27, 13, 34, 2, 50, 12 1. If the array were sorted using the version of mergesort presented in lecture, what would the array look like after the completion of the second call to the merge method-the method that merges two subarrays? Note: The merge method is the separate helper method; is not the recursive mSort method. 2. What would the array look like after the completion of the fourth call to the mergeO method? 3. The initial call to the recursive mSortO method is made from within the mergeSortO "wrapper" method. This initial call to mSortO is not a recursive call, because the method is not calling itself. Rather, all recursive calls to mSort are made from within mSortO. Assuming that the array has at least two elements, the initial invocation of mSortO makes two recursive calls (which in turn lead to other recursive calls, and so on). Starting with the initial array above, what would the array look like after the completion of the first of these two recursive calls? Important There will be no partial credit on the above questions, so please check your answers carefully