Exercise 2. MATRIX MULTIPLICATION. Assume a RAM model of computation. The purpose is to derive

efficient algorithms for multiplying an n × k matrix A with a k × n matrix B. The resulting matrix,

C = AB is of dimension n xn. Grade school multiplication can be done in time (n²k), where now both

n and k can be large. Suggest more efficient methods for all choices of k and n, paying, in particular,

attention to the cases k = o(n), and n = o(k).