Using definitions and theorems discussed in class, prove the following.

A language $L$ is regular if and only if $($iff$)$ some regular expression describes $($generates$)$ it$.$