In the Master Theorem T(n)=aT(n/b)+f(n)T(n) = aT(n/b) + f(n)T(n)=aT(n/b)+f(n), what does aaa represent?
The time spent on merging results
The depth of the recursion tree
The number of subproblems created at each step
The factor by which input size is reduced