How do i prove this language is regular?
Build a finite state machine. Or look up the definition, your definition will either say &quot;there's a finite state machine&quot;, or &quot;it's defined by a regular expression&quot;.