Data Structure algorithm Question

Run the MergeSort algorithm by hand on the list L = (57329). Specifically, a. Draw a tree representing the recursive calls done by the algorithm, for this input. b. For each recursive step, write down the associated values of p and r. If p < r, then also write down the value of q and the two lists (denoted J and K in class) that are input to Merge at this step