Which of the following is true regarding the number of computations required to compute an N-point DFT?

N 2 complex additions and N(N-1) complex multiplications

N2 complex multiplications and N(N-1) complex additions

N2 complex additions and N(N-1) complex multiplications

N2 complex multiplications and N(N+1) complex additions

N2 complex additions and N(N+1) complex multiplications

Which of the following is true regarding the number of computations re

1.	Which of the following is true regarding the number of computations required to compute an N-point DFT?
A.	N<sup>2</sup> complex multiplications and N(N-1) complex additions
B.	N<sup>2</sup> complex additions and N(N-1) complex multiplications
C.	N<sup>2</sup> complex multiplications and N(N+1) complex additions
D.	N<sup>2</sup> complex additions and N(N+1) complex multiplications
Answer» B. N<sup>2</sup> complex additions and N(N-1) complex multiplications