Please, solve the example in a simple way.

Example 9.3. Figure P9.3-1 shows the flow graph for an 8-point decimation-in-time FFT algorithm. Let x[n] be the sequence whose DFT is X[k]. In the flow graph, A[.], B[.), C[], and D[:] represent separate arrays that are indexed consecutively in the same order as the indicated nodes. (a) Specify how the elements of the sequence x[n] should be placed in the array A[r],r = 0,1, ..., 7. Also, specify how the elements of the DFT sequence should be extracted from the array D[r), r = 0, 1, ...,7. (b) Without determining the values in the intermediate arrays, B[-] and C[.), determine and sketch the array sequence D[r), r = 0,1,..., 7, if the input sequence is x[n] = (-Wn)", n=0,1,..., 7. (c) Determine and sketch the sequence C[r), r = 0, 1, ...,7, if the output Fourier trans- form is X[k] = 1, k = 0, 1, ..., 7. BOJ C[O A 100 2010 w 811) A[1] CI D[1] B[2] wg C[2] . A[2] +902 w9 813) w A[3] C[3] -1 [3] B[41 A[40- C14 % D[4 w B[5] C15) W A[5] DIS B[6] w C[6] w A[6] D[61 w! BI7) w C[7] w: A1710 DIU Flaure P9.3-1