Code referenced in problem in case if needed

1. (10 Points) Trace bottom-up merge sort with the following input, where merge result with sz-k should contain the result of merging adjacentsub-arrays each with size of k. The last row should contain the final sorted result. Index (0 Input 342 773429966 19952 711133684143 Merge Result SZ 1 Merge Result sz=2 Merge Result SZ 4 Merge Result SZ 8 2 3 4 5 6 7 8 2. (5 Points) Does the merge method produce the proper output if two input subarrays are not in sorted order? Prove your answer or provide a counter example