Please be as detailed as possible in words.

(a) Given an n-bit integer number a = an-1an-2... do define a polynomial A(2) satisfying A(2) = a. (b) Given two n-bit integers a and b, give an algorithm to multiply them in O(n log(n)) time. Use the FFT algorithm from class as a black-box i.e. don't rewrite the code, just say run FFT on ...).Explain your algorithm in words and analyze its running time. (a) Given an n-bit integer number a = an-1an-2... do define a polynomial A(2) satisfying A(2) = a. (b) Given two n-bit integers a and b, give an algorithm to multiply them in O(n log(n)) time. Use the FFT algorithm from class as a black-box i.e. don't rewrite the code, just say run FFT on ...).Explain your algorithm in words and analyze its running time