A Circular matrix is an n×n matrix A which is defined by its first row, and then successive rows are obtained by ""rotating"" the first row to the left by one slot, i. e.an−1 a0  a1    an−4 an−3 an−2 Let B = [b0,b1,b2,...,bn−1] a vector of size n. We want to compute C = A·B by regular row by column product, which normally would require O(n2) scalar multiplications. Our goal is to achieve an O(log n) time algorithm when A is a circular matrix. To achieve this, you need to think of an efficient way to represent the matrix, and you will have to use the FFT algorithm. •Normally an arbitrary n × n matrix requires n2 elements to be stored. How can you represent our circular matrix A with a vector A˜ of n elements"?