Q. 16 For a N -point FET algorithm 
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 mth stage in N/m
(C) In-place computation requires storage of only 2N data
(D) Computation of a butterfly requires only one complex multiplication.
Answer: D
Explanation:
