2. (10 points) Consider the following NFA: 0 C2) (a) (2 points) Simulate this NFA on the input 1011. That is, for each prefix of this input string, write down the states that the NFA could reach. (b) (4 points) Give an equivalent DFA for this NFA, Make sure to indicate starting and accepting states, (c)( /4 points) Give an NFA for the language consisting of words where one can remove at most one character to obtain a string accepted by this NFA. That is, give an NFA for the language {w = xayla E X,Y EL} where L is the language accepted by the NFA given at the start of this