let a and b be two n-bit integers (a)Is it possible to design an algorithm for computing a^2 which is asymptotically faster than computing a * b (b)Is it possible to design an algorithm for computing a * b which is asymptotically faster than computing a^2