Strassen's method [AHU 74, CLR90] for matrix multiplication is an algorithm based on the using technique. The sequential complexity of multiplying two n x n matrices using Strassen's algorithm is (n^2.81). Consider the simple matrix multiplication algorithm (Section 8.2.1) for multiplying two n x n matrices using p processes. Assume that the n/Squareroot p x n/Squareroot p submatrices are multiplied using Strassen's algorithm at each process. Derive expression for the parallel run time of this algorithm. Is the parallel algorithm cost-optimal