Suppose that a bank only permits passwords that arcde strings from the

alphabets $=\{$a$,$ b$.$c$,$ d$,1,2,3,4,$ #$,$ $$,$ &$\}.$ The passwords follow the

rules

$($a$)$ The length can be $5,6$ or $7.$

$($b$)$ The first alphabet must be from $\{$a$,$ b$,$ c$,$ d$\}.$

$($c$)$ The last two alphabets must be from $\{1,2,3,4\}$

$($d$)$ Exactly one alphabet should be from $\{$#$,$ $$,$ &$\}.$

The set of legal passwords forms a regular language L$.$ Construct a

NFA for L$.$ Show answer ALSO IN VISUAL FORM with transitional map.