Write a proof for the following statement:

Language L $=\{1$n $|$ n $>=0\}$ is regular.

$($Please write your proof in the p;rovided text box; do not submit any files.