Q. 3 Maximum score 12 Give an NFA for the following expression: ((aaUb)*(aba)*bab)*. Simplify the expression if you can. Q.4 Maximum score 13 Write a regular expression for the language recognized by the following DFA. 5 Maximum score 25 (part (a) 5 points, part (b) 20 points) Consider an NFA defined by the following transition table {5} {2,4} I {1) {3} 2 4 {5} {4} (a) Convert this table to the corresponding table for the NFA without transitions (b) Convert the resulting NFA into DFA