What is the code for generating X(k) from given X(n) = [1 2 3 4] using Fast Fourier Transform?

There is this sequen of X(n) = [1 2 3 4] how do i get the X(k) using FFT function? What is the code for the function? And also the code for IFFT. Thank you

Answer 1

[Chunru]

x = [1 2 3 4];
xfft = fft(x)

xfft = 
  10.0000 + 0.0000i  -2.0000 + 2.0000i  -2.0000 + 0.0000i  -2.0000 - 2.0000i

y = ifft(xfft)

y = 1×4

1 2 3 4

[Sentia Arianti]

Is it that simple? Thank you before and how about to plotted it?