For a 16-point FFT, the speedup gain of performing complex multiplications when compared to executing using DFT is -10.7.
For an 8-point distributed FFT implementation, the complexity for executing real multiplications is:
a. 27
b. 14
c. 24
d. 48
e. 9
f. 32
g. 12