SHOW ALL WORK, please do not make any jumps.It does not need to be long, just fully cover each step please. Will Like post if done quickly

(b. 10 points) Please see the figure below for the process of MergeSort. Please use the divideand-conquer technique to design the MergeSort and Merge algorithms. You also need to analyze the running time of this process. Note: the size of the array A is n, not the eight numbers in the figure. Problem 3 (30 points, 10 points each). Solve the following three recurrences using Master Theorem. Please state the case number and the constant values used. a) T(n)=2T(4n)+1 b) T(n)=2T(4n)+n