Part $1$: Solving for Finite State Automata $($FSA$)-50$ pts

For the two languages described below, draw the full Finite State Automata for each. Keep in mind that

Deterministic Finite Automata $($DFA$)$ require that each state contain a single transition for every symbol in the

language's alphabet. DFA also do not allow for Epsilon$/$Null transitions. Transitions must be drawn with

directional arrows that clearly shows the transition element and the final state$($s$)$ must be clearly marked with

the double circle

Construct a Deterministic Finite State Automata for the following language:

$L_1=\{c^{**}{b}^{+}{a}^{+}c\}$

$=\{a,b,c\}$