Q.4 Maximum score 13 Write a regular expression for the language recognized by the following DFA Q5 Maximum score 25 (part (a) 5 points, part (b) 20 points) Consider an NFA defined by the following transition table I {1) {3} {5} {2,4} 4 (5 4 D (a) Convert this table to the corresponding table for the NFA without transitions (b) Convert the resulting NFA into DFA. Q.4 Maximum score 13 Write a regular expression for the language recognized by the following DFA Q5 Maximum score 25 (part (a) 5 points, part (b) 20 points) Consider an NFA defined by the following transition table I {1) {3} {5} {2,4} 4 (5 4 D (a) Convert this table to the corresponding table for the NFA without transitions (b) Convert the resulting NFA into DFA