One wants to optain Fast Fourier Transform (FFT) of an array. a) For this purpose, obtain the Butterfly-2 (Radix-2) approach with Decimation-in-Time step by step and determine the necessary procedures. Obtain the number of operations. b) Given x(n) = {0,6,2,0,3,0,2,6} array, find FFT and obtain number of operation.