Understanding the Discrete Fourier Transform and the FFT

Q3 a) Develop a radix-2 DIF- FFT algorithm for N=8 and draw the corresponding signal flow graph. b) Find DFT of the sequence x(n) = 2, 2, 3, 3 using DIT-FFT algorithm and compute the number of complex multiplications and additions required.