Set of Finite Strings is Countably Infinite

Theorem
Let $\Sigma$ be a finite alphabet.

Let $\Sigma^*$ be the set of finite strings of $\Sigma$.

Then $\Sigma^*$ is a countably infinite set.