Let M (n) be the time to multiply two n × n matrices, and let S (n) denote the time required to square an n × n matrix. Show that multiplying and squaring matrices have essentially the same difficulty: an M(n)-time matrix-multiplication algorithm implies an O(M (n))-time squaring algorithm, and an S(n)-time squaring algorithm implies an O(S (n))-time matrix-multiplication algorithm.