5. [10 pts] The basic divide-and-conquer technique for multiplying two n-digit integers cleverly saves one out of four multiplication and yields the recurrence T(n) = 3T(n/2) + on and gives so 0(n'.) algorithm. However, it is possible to do much better. Show how the Fast Fourier Trans-form, which is a method for multiplying two n-degree polynomials, can be used to actually multiply two n-digit integers in time 0(n log n). Hint: as a first step, create polynomials from your integers.