$051)$Let $=\{$ L$,$ O I $.$ L is any letter $,$ O is any other symbolFind a finite automaton without $-$transitions and with a single final state which accepts any password P with the following rules:$[$PI$4$P begins with a letter $($L$.)$ and ends with a letter $($L$)$P contains at least one other symbol $(0)$Every two consecutive other symbols$($OO$)$ must be followed immediately by a letter $($L$)2)$Given the following:La is denoted by b$($etac$)$a$\text{'}$b$\text{'}$e$*$ La is denoted by $($d$,$ e$,$ fJ$*$ except $(\{$f : n$20]$U$($e$,$ ed $\}]$Is it possible to find an FA without $.$ transitions and with no more than two final states for La UL$,?.$If no explain why. If yes explain how$3)$Is it possible to find a regular expression for the language generated by the grammar?S $->$ ABC $|$ deD $|$ cSA $->$ BB I aB $->$ AB bC$->$ ceCe Ic $|$ ceD$->^$ I dEeE$->$ Eee ldIt no explain why. If yes explain how