Please provide clear and detail algorithms for question 1 and 2 I need these asap

Let T(n) be the time to multiply two n n matrices together. For simplicity, you may ignore any dependence on the size of the entries of the matrices. Given a matrix A, the square of the matrix is defined as A2-A A and, more generally, for p 2 2, the p-th power is defined as AAXAX..XA where the product consists of p copies of A. The faster the algorithms you design, the more marks you will get. Your answers should include a brief description of your algorithms and an analysis of the running time (perhaps in terms of T(n)) You do not need to prove correctness 1. Design an algorithm for computing the p-th power of a matrix A where p is a power of two. You may assume the existence of a subroutine to multiply matrices together 2. Suppose you have developed an algorithm that can find the square of a matrix in O(n2) time. Using this algorithm as a subroutine, find an algorithm that multiplies two n x n different matrices together in O(n2) time