Q3. Draw the complete recursion tree for merge sort analysis for n=2⁵ (similar to Slide 23 of Lecture 2). Draw the complete tree up to the last level. Then calculate the number of steps for merging at each level in the right side. Finally, find the total number of steps for merging by numbers (not in O notation).

Everything should be done for n = 2⁵ (not for n = 2^m).