Recursionhard
0:00.0

Which of the following describes the behavior of a divide-and-conquer recurrence T(n)=aT(n/b)+f(n)T(n) = aT(n/b) + f(n) if the work done at each level of the recursion tree decreases geometrically?