fft takes as argument a list (or a sequence) [a0,..aN-1] where N is a power of two. fft returns the list [b0,..bN-1] such that, for k=0..N-1
where ωN is a primitive N-th root of the unity. Input :
Output :