Question: Draw a flow graph for a 10-point decimation-in-time FFT algorithm using two DFTs of size 5 in the first stage of the flow graph and five DFTs of size 2 in the second stage. Compare the computational complexity of the algorithm with the direct approach based on the definition.