Question: $[20$ Points$]$ For each of the following languages over $=\{$a$,$b$\},$ write a regular grammarand then convert it into an equivalent NFA using the procedure described in class.$($a$)(10$ Points$)$ L$($r$)$ where r$=(($a$+$b$)($a$+$b$))*$b$+$a$(($a$+$b$)($a$+$b$))*$; and$($b$)(10$ Points$)\{$win$\{$a$,$b$\}*$:w ends in a and $\{$:$|$w$|-=1($mod$3)\}.[20$ Points$]$ For each of the following languages over $=\{$a$,$b$\},$ write a regular grammarand then convert it into an equivalent NFA using the procedure described in class.$($a$)(10$ Points$)$ L$($r$)$ where r$=(($a$+$b$)($a$+$b$))*$b$+$a$(($a$+$b$)($a$+$b$))*$; and$($b$)(10$ Points$)\{$win$\{$a$,$b$\}*$:w ends in a and $\{$:$|$w$|-=1($mod$3)\}$