$(8$ points$)$ On $=\{a,b\}$ Show by construction $($draw ONE NFA$)$ OR $($create one regular expression$)$ to

show that the union of the following $2$ regular languages $($L$1$ and L$2)$ is also a regular language:

On $=\{a,b\}$

L$1($Language $1)$: every string in the language begins with two $a\text{'}$s and ends with an even number

of $b\text{'}$s $-$ example string: aabaabbababbbbbb

L$2($language $2)$:L$2=\{$w:na$($w$)$mod$3=1\}$