The SQUARE problem is$$given an integer x written in binary as input$$to compute the binary

representation of its square x

$2$

$.$ The MULTIPLY problem is$$given two integers y and z written

in binary as input$$to compute the binary representation of their product yz$.$

Prove that if there is an O$($f$($n$))-$time algorithm for SQUARE then there is an O$($f$($n$))-$time

algorithm for MULTIPLY.Conclude that the SQUARE problem cannot be solved asymptotically faster than the MULTIPLY problem