Construct a non$-$deterministic finite automata $($NFA$)N_1$ to accept the language

$L_1=\{\begin{array}{ccc}\text{x}\text{i}\text{n}& \{a,b,& c{\}}^{*}|\end{array}$ the second last symbol of $x$ is $b$ OR the third last symbol of $x$ is $\{$:$a\}.$

Extra Credit: You get extra points if the automata you construct has the minimum number of

states needed by any NFA that accepts $L_1.$