In the Master Theorem formula T(n) = aT(n/b) + f(n), what does the constant 'a' represent?

Number of subproblems

The Master Theorem provides a 'cookbook' recipe for solving recurrences of divide-and-conquer algorithms. Here, 'a' must be at least 1, representing how many recursive calls are made at each level.