Consider the following NFA with -transitions: On your paper, construct the equivalent NFA without -transitions using the procedure seen in class and in the textbook, including the "i-k-x-j" table. Process not product. Remember that each transition in the resulting automaton must correspond to a row in your table. Then answer the following questions: a. Yes or no: Is state 4-reachable from state 1 ? b. Yes or no: Is state 2-reachable from state 3 ? c. Yes or no: Is state 0 "important"? d. Yes or no: Is state 4 "important"? e. Yes or no: Is 2-3-b-4 a row in the table? f. Yes or no: Is 1-0-a-1 a row in the table? g. How many states are there in the resulting automaton? (enter the number using the digits 09 ) h. How many transitions are there in the resulting automaton? (enter the number using the digits 0-9) i. Yes or no: Is state 0 an accepting state in the resulting automaton? j. Yes or no: Is state 1 an accepting state in the resulting automaton