Consider the following epsilon-NFA E a 6 5 7 b 8 E a 1 2 3 4 a) Compute the epsilon-closure of each state. b) Convert to equivalent DFA. c) Design an NFA for the following regular expression i) ii) (0+1)*01* 01*+10*(1+00) -- --2 marks - 4 marks --4 marks