Bottom-Up Mergesort Analysis
lLet T(j) = steps at levels < j

lThen
lT(1) = c n, c some constant
lT(j+1) = T(j) + c n

lT(log(n)) is the time to sort n elements
= c n log(n)