Problem
1. Give a complete pseudo-code description of the recursive merge-sort algorithm that takes an array as its input and output.
2. Show that the running time of the merge-sort algorithm on an n-element sequence is O(nlogn), even when n is not a power of 2.