Create a decider TM MAfor the following language:

ENDNFA$\_$s$=\{|$ N is an NFA, s is a symbol in the alphabet of the NFA and N rejects at least one string that ends on symbol s $\}$

So far I wrote the following, and the decider must have explicit decisions so it halts:

END$\_$NFAs T $=$ on input string $,$ where N is an NFA, s is a symbol in the alphabet of the NFA and N rejects at least one string that ends on symbol s$.$

T checks whether is a valid encoding of an NFA and symbol s is in the alphabet of N

if invalid then

T rejects

else

$?$