2. Converting FAs to and from Regular Expressions [15] (a) Find the regular expression equivalent to the following DFA using the state- elimination algorithm, showing all steps involved. [9] 90 0. 91 93 0 i. (00)*1 ii. + 10 + 10(011) * iii. (*+ (1e1)*)* 1 0 1 92 94 1 1 0 96 0 95 0,1 (b) Convert the following regular expressions to e-NFAs over the alphabet {0,1}. [6] [2] 2. Converting FAs to and from Regular Expressions [15] (a) Find the regular expression equivalent to the following DFA using the state- elimination algorithm, showing all steps involved. [9] 90 0. 91 93 0 i. (00)*1 ii. + 10 + 10(011) * iii. (*+ (1e1)*)* 1 0 1 92 94 1 1 0 96 0 95 0,1 (b) Convert the following regular expressions to e-NFAs over the alphabet {0,1}. [6] [2]