Please send maple code.

(d) Program the FFT in Maple as a recursive procedure. Your Maple procedure should take as input (n,A,p,) where n is a power of 2,A is an array of size n storing the input coefficients a0,a1,,an1, a prime p and a primitive n 'th root of unity in Zp. If you want to precompute an array W=[1,,2,,n/21] of the powers of to save multiplications you may do so. Test your procedure on the following input. Let A=[1,2,3,4,3,2,1,0],p=97 and w be the primitive 8 'th root of unity. To check that your output B is correct, verify that FFT(n,B,p,1)=nAmodp