Computer algorithm

3) The recurrence relation for Strassen's algorithm for matrix multiplication is for n= 1 t(n) = 7 T(n/2) + (r) forn 1 a) This has solution T(n-6(-). (3 pts.) b) Apply the Master method to prove your answer. (6 pts.) c) The naive algorithm for matrix multiplication has running time ). Show that Strassen's algorithm is asymptotically faster. (3 pts.)