For each of the following languages, construct an FSA that recognizes it:

$($a$)L_1=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{a,& b{\}}^{**}|a^{\text{'}}\end{array}$ s are separated by an even number of $\{$:$b^{\text{'}}s\}$

$($b$)L_2=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{a,b{\}}^{**}|aa!\text{i}\text{n}\text{s}\text{u}\text{b}& (w)\end{array}$ and $\{$:$bb!$insub$(w)\}$

$($c$)L_3=L((ab{)}^{**}c)$

$($d$)L_4=L(a{b}^{**}{c}^{**})$

$($e$)L_5=L_3{L}_4$