There is limited parallelism in merge sort because the merge operation is naturally sequential. Question: Rewrite merge to make it suitable to execute with P processors. (Hint: it is one of these cases where you may have to increase complexity slightly.) Question: What are the work and critical path of the merge algorithm you created? Question: If you used that parallel merge in merge sort, what would the work and critical path of merge sort become?