(25%). Consider that you have a sparse matrix with only q nonzero values distributed randomly among the n rows of the n*n matrix. Which sparse matrix representation is the best (coordinate, compressed sparse row. diagonal storage, bit-vector)? Describe pros and cons for each of these representations based on storage requirements and the computational complexity (use Matrix*Matrix multiplication to evaluate complexity).