###
For an N-point FFT algorithm with N = 2^{m} which one of the following statements is** TRUE?**

^{m}which one of the following statements is

**TRUE?**

(A) It is not possible to construct a signal flow graph with both input and output in normal order |

(B) The number of butterflies in the m^{th} stage is N/m |

(C) In-place computation requires storage of only 2N node data |

(D) Computation of a butterfly requires only one complex multiplication |

**{{explanations.length}} Explanations**

**Explain this Question**