I was wondering if my proof/solution for i & ii was fine. Any feedback is greatly appreciated, please. Thank you. $\def\R{{\mathbb R}} % real numbers \def\N{{\mathbb N}}$
Let $E_1\supseteq E_2\supseteq \,\cdots\,\supseteq E_k\supseteq \,\cdots$ be a decreasing sequence of nonempty, closed subsets of $\R^n$.
(i) Prove if $E_1$ is compact, then $\displaystyle{\bigcap_{n=1}^\infty E_n}\ne\emptyset$.
$\textbf{Proof:}$ Assume $E_1$ is compact. Since each $E_n$ is non-empty, choose a point $x_n \in E_n$ for all $n\in\N$. Then $\{x_n\}$ be a sequence in $\R^n$. Now, each $E_n\subseteq E_n$ for all $n\ge 2$. So, $x_n \in E_1$ for all $n\in \N$.
Now, $E_1$ is compact. So $\{x_n\}$ has a convergent subsequence. Let $\{x_{n_k}\}$ be the subsequence of $\{x_n\}$ which converges to $x\in \R^n$.
Our claim is that $\displaystyle{x\in \bigcap_{n=1}^\infty E_n}$. As $x_{n_k} \to x$, so every neighbourhood of $x$ contains all, but excepting finitely many possibly.
Now, for all $n\in \N, x_m\in E_n$ for all $m\ge n$ as $x_m \in E_m \subseteq E_n$ for all $m\ge n$ implies $x_{n_k} \in E_n$ for all $m\ge n$. Therefore, as $n_m \ge m$ implies each neighbourhood of $x$ intersects $E_n$ and implies $x\in \overline{E_n} = E_n$, $E_n$ is closed, for all $n\in \N$. So, $\displaystyle{x\in \bigcap_{n=1}^\infty E_n}$.
(ii) Provide an example of a sequence as above with the property $\displaystyle{\bigcap_{n=1}^\infty E_n}=\emptyset$.
$\textbf{Solution:}$ Take $E_k = \N \setminus \{1,2,3,\dots , k\}$ for all $k\in \N$. Then each $E_k$ is a closed subset of $\R$. Also, $E_1\supseteq E_2\supseteq \dots$ . Now, $$\bigcap_{n=1}^\infty E_n = \N\setminus \{1,2,3, \dots\} = \emptyset.$$ Thus, $\{E_n\}$ is a sequence of closed nonempty subsets of $\R$ with $\displaystyle{\bigcap_{n=1}^\infty E_n = \emptyset}.$
Your proof is correct, if your definition of compact is sequential compactness (i.e., in terms of sequences).
What you have proved here is known as Cantor's intersection theorem, you can compare your proof with that on Wikipedia which is basically the same.