(a) Given an n-bit integer number a=anan1a1a0 define a polynomial A(x) satisfying A(2)=a (b) Given two n-bit integers a and b, give an algorithm to multiply them in O(nlog(n)) time Note: For part (a), you are submitting a polynomial in mathematical notation. For part (b), you are submitting a Divide \& Conquer solution which uses the FFT algorithm from class as a black-box (i.e. don't rewrite the code; describe how to transform the problem into valid and complete input for the FFT algorithm, and how you use the output from FFT to determine the solution to the original problem)