Hi pls help with G and H, need this urgently. Accurate answers, don't copy others pls and upvote guaranteed. Thanks.

[answerhappygod]

Hi pls help with G and H, need this urgently.
Accurate answers, don't copy others pls and upvote guaranteed.
Thanks.

Hi Pls Help With G And H Need This Urgently Accurate Answers Don T Copy Others Pls And Upvote Guaranteed Thanks 1 (28.47 KiB) Viewed 48 times

Q5(iv) The Fast-Fourier Transform (FFT) g) The DFT is applied to a sequence 3 that is 216 samples long. Approximately how many complex operations are required for this operation? Answer to 3-sig figs. Scientific notation allowed. Round your answer to 3 significant figures. Submit part 1 mark Unanswered h) If a fast Fourier transform (FFT) algorithm is used to compute the DFT for part g) Approximately how many complex operations are required now? Round your answer to the nearest integer. Submit part 1 mark