In this exercise, we examine the complexity of matrix-vector multiplications, expressed in terms of floating- point operations per second (flops), which counts the number of additions and multiplications. Usually when comparing two computation methods, we do not take into account fixed factor of 2 or 3 in flop count to be significant, but in this exercise we do. 1. What is the complexity of computing the scalar product of two n-vectors? 2. What is the complexity of computing the a matrix-vector product Ax, where x is a n-vector and A is a m x n matrix ? 3. Suppose you want to compute the product (AB)x, where A, B are nxn matrices, and x is a n-vector. What is the most efficient way, from the point of view of complexity, to perform this operation