(a) Suppose we could multiply two 33 matrices using 25 scalar multiplications and a constant number of scalar additions and subtractions. Set up and solve the recurrence relations to analyze the resulting divide-and-conquer algorithm for matrix multiplication.

(b) Suppose we could multiply two 33 matrices using r scalar multiplications and a constant number of scalar additions and subtractions. How small would r have to be to make the resulting divide-and-conquer algorithm for matrix multiplication asymptotically faster than Strassens matrix multiplication algorithm? Justify your answer.