Part (b) [4 MARKs] r Theorem (below) and yourr fast mult(A, B, n). Master Theorem: Given a divide-and-conquer recurrence T" of the form: if n B T(n) = 0, f(n) is the cost of splitting and recombining, and f ? (nd) where B, k > 0, ?, ?? > 0, a for some d N.. Then: Part (c) [4 MARKs] Use your answer in part (a) to prove that T(n)