Which of the following describes the Master Theorem?
A way to solve all recursive relations
A method to solve recurrences of the form T(n)=aT(n/b)+f(n)T(n) = aT(n/b) + f(n)T(n)=aT(n/b)+f(n)
A way to prove the correctness of algorithms
A tool for memory allocation in recursion