Question $1$

Consider a time complexity for a Divide and Conquer algorithm written as a recurrence:

$T(n)=aT(\frac{n}{b})+(n^2)$

What does the a value represent in our algorithm?

The depth of the recursive tree

The number of leaf nodes in the recursive tree

The fractional size of the input sent to each recursive call

a small constant value we will ignore in asymptotic notation

The number of recursive calls made in each iteration of the function

The time it takes to divide the input and recombine into one solution