The square of a matrix A is its product with itself, AA.(a) Show that 5 multiplications are sucient to compute the square of a 22 matrix. (5pts)(b) What is wrong with the following algorithm for computing the square of an nn matrix?(5pts)Use a divide-and-conquer approach as in Strassen's algorithm, except that insteadof getting 7 subproblems of size n = 2, we now get 5 subproblems of size n = 2thanks to part (a). Using the same analysis as in Strassen's algorithm, we canconclude that the algorithm runs in time O(nlog2 5).