User write the transitions of L $($ M $)=\{$ w in $\backslash$ Sigma $$ n $($ a $)($ w $)=2$and n $($ b $)($ w $)>3\}.$Where inputs such as ababbb, abbabb, bbbbbbbaa, bbbabbba, abbbbbbbba, should be accepted. And inputs like aab, babba, bbbabaabab, bbabb should be rejected. $($ n $($ a $)$is the number of a $\text{'}$ s and n $($ b $)$is the number of b $\text{'}$ sTo do in this exercise $...$

Use JFLAP to define a Deterministic Finite Accepter $M$ such that

$,L(M)=\{win{}^{**}$:$n_a(w)=2^{{?}^{?}}{n}_b(w)>3\}.$The number of a$\text{'}$s should be exactly $2$ AND the number of b$\text{'}$s should be $3.$ Otherwise known as greater than or equal to $4.$

Save your Determinsitic Finite Accepter as a $.$jff file, and submit

that $.$jff file to Canvas as your solution to this exercise.

JFLAP :