1. Imagine a slightly altered version of Merge sort that splits the array into thirds (rather than in half),
recurses on each of these three 0.333n-length subarrays, and then afterward merges the three sorted
subarrays together. What is the (exact) height of the recursion tree of this modified algorithm?

 

2. How many nodes would there be on level i of the modified Merge sort algorithm's recursion tree?