Answers are in blue typeface .
Do not write code for merge-sort. Produce a budget of computational work for the sorting architecture you developed in Question 1. Given this budget, produce a Big-Oh estimate of complexity, and show the assumptions you used to arrive at that estimate. Do not write code for quick-sort. Analyze the complexity of the algorithm for each of the three cases you developed in Question 3, in the same way as required in Question 2.