(i) For a dense input matrix, randomized algorithms require O (mn log (k)) floating-point operations (flops) in contrast to O (mnk) for classical algorithms. (ii) For a sparse input matrix, the flop ...