Please draw with a image Construct a non

$-$

deterministic finite automata

$($

NFA

$)$

$$N

$1$

$$to accept the language

L

$1$

$=$

$\{$

x

$\backslash$

epsi

$\{$

a

$,$

$$b

$,$

$$c

$\}$

$*$

$|$

$$the second last symbol of x is b OR the third last symbol of x is a

$\}$

$$Then DRAW THE ConverIison the NFA N

$1$

$$you construct in to a DFA using the subsets

$-$

technique