Statement $($I$)$: FFT is a much faster version of the DFT algorithm.

Statement $($II$)$: Time complexity of DFT is $O(N^2)$ and the time complexity od FFT is $O(NlogN)$ for $N$ point discrete signal.