Below is the description of an NFA N$.$

$$Convert it to a NFA that recognizes Drop$($L$($N$)).$ Meaning that N reads a string in the format xby so our converted NFA N$$ will read xy$,$ for example if N reads $101$ N$$ will read $11$ or if N reads $011$ N$$ will read $01.$

N:

$$

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

input$\_$alphabet $=\{0,1\}$

start$\_$state $=$ d

accept$\_$states $=\{$b$,$d$\}$

delta $=$

$$ a$,0->$a;

$$ a$,1->\{$b$,$c$\}$;

$$ a$,$ epsilon $->$c;

$$ b$,0->\{$b$,$c$\}$;

$$ b$,$ epsilon $->$b;

$$ c$,1->\{$c$,$d$\}$;

$$ d$,0->$c;