<p>You decided to modify mergesort by recursively splitting anarray of size n<br/>into k sorted subarrays; k > 2, and merging these subarrays.Time for merging is c(k??1)n<br/>where c is a constant
<p><img alt="Exercise 3.62. A little boy plays outside in the yard. On his own he would come back inside at a random time uniformly distributed on the interval [O, 1].