How much storage (in bytes) is needed to store a sparse matrix of size 10,000 x 10,000 where only 10% of the entries are relevant? You need to define what data structure/strategy will be used in your analysis (see notes on sparse matrices). Assume all entries of the matrix are 8 byte references. No need to consider space for the objects pointed to by these references. You do not need to describe the most efficient way to store sparse matrices. Just any reasonable strategy is fine