Show all of your work in a clear and orderly manner to get full credit
Problem #1
Given a sequence $x(n)$ for $0 \leq n \leq 3$, where $x(0) = 1$, $x(1) = 1$,
$x(2) = -1$, and $x(3) = 0$, compute its DFT $X(k)$.
(Show your complete work using DFT formula, then confirm your work with MATLAB)