Which of the following statement is true?
The total number of complex multiplications required to compute 4-point DFT of a discrete time sequence, x[n], by radix-2 FFT is $4 \log_2 4$.
The total number of complex additions required to compute 4-point DFT of a discrete time sequence, x[n], by radix-2 FFT is $4\log_2 4$.
The total number of complex additions required to compute 4-point DFT of a discrete time sequence, x[n], by radix-2 FFT is $\frac{N}{2}\log_2 N$.
The total number of complex multiplications required to compute 4-point DFT of a discrete time sequence, x[n], by radix-2 FFT is $N \log_2 N$.