In the merge sort analtsis, we discussed the analysis using a recursion tree. roughly how many levels does the mergesort recursion tree have (as a function of n, the length of the input array)?
a. a constant number (independent of input)
b. Log₂N
c. √n
d. n