Assume we want to sort an array A[1..n] based on merge sort algorithm and you have been already provided with an implementation of the merge procedure Merge(A, p, q, r) to combine two sorted arrays A[p..q] and A[q+1..r], that is you can use this procedure directly: Write the pseudocode for the merge sort algorithm. Draw a tree diagram to demonstrate the merge sorting process of the following sequence: 5 4 3 2 1. Similarly, if you are provided with a procedure Find-Max-Crossing-Subarray (A, low, mid, high), write the pseudocode for a divide-and-conquer algorithm to solve the maximum subarray problem, which has been described in Question 2. Here is question 2 for the third part (I have also provided an image of the array problem as well): Given an array A[1…n] of numeric values (can be positive, zero, and negative) determine the subarray A[i…j] (1≤ i ≤ j ≤ n) whose sum of elements is maximum over all subvectors. Below is a brute-force algorithm. Analyze its best case, worst case and average case time complexity in terms of a polynomial of n and the asymptotic notation of ɵ. You need to show the steps of your analysis.

Question

Assume we want to sort an array A[1..n] based on merge sort algorithm and you have been already provided with an implementation of the merge procedure Merge(A, p, q, r) to combine two sorted arrays A[p..q] and A[q+1..r], that is you can use this procedure directly:

Write the pseudocode for the merge sort algorithm.
Draw a tree diagram to demonstrate the merge sorting process of the following sequence: 5 4 3 2 1.
Similarly, if you are provided with a procedure Find-Max-Crossing-Subarray (A, low, mid, high), write the pseudocode for a divide-and-conquer algorithm to solve the maximum subarray problem, which has been described in Question 2.

Here is question 2 for the third part (I have also provided an image of the array problem as well):

Given an array A[1…n] of numeric values (can be positive, zero, and negative) determine the subarray A[i…j] (1≤ i ≤ j ≤ n) whose sum of elements is maximum over all subvectors. Below is a brute-force algorithm. Analyze its best case, worst case and average case time complexity in terms of a polynomial of n and the asymptotic notation of ɵ. You need to show the steps of your analysis.