Show that computing the square of an n-bit integer is asymptotically as hard as multiplying two n-bit integers. Or equivalently, show that you can multiply two n-bit integers in O(T(n)) time if you c:
a) O(n²)
b) O(n log n)
c) O(n³)
d) O(2ⁿ)