Consider the following two languages over the alphabet $=\{a,b\}$:$L_1$ is the language of all words

with at least two $b\text{'}$s and $L_2$ is the language of all words that ends with the substring $ab.$

a$)$ Using the trial and effort method we demonstrated in lecture, draw $F{A}_1$ : a machine that $L_1$

and $F{A}_2$ : a machine that accepts $L_2.$

b$)$ Using the algorithm provided by Kleene's Theorem, construct the FA machine that accepts

$L_1+L_2.$