Write a program that accepts as input a description of a nondeterministic finite automaton with E-moves (NFA-e) over the alphabet Σ = {a,b} followed by a sequence of one or more

words. Your program should simulate the NFA-e and report whether each word was accepted or rejected by the NFA-€.