Question: Assume that K = 3 3 . Draw the flow graph for a K-point decimationin-time FFT algorithm consisting of three stages by using radix-3 as the basic building block. Compare the computational complexity of the algorithm with the direct approach based on the definition.