Q. Construct finite automata for the given regular expressions

(a). (ab⁺a + ab) ^* + ((a + bba^*) + ba⁺b) ^*) ^*+ ((aa)^* + bb^*)

(b). (ab)^* aa (ba)^* + ( + a) ^* b^*(abb^*) ^*(a + ba⁺) + (bb)^*b

(c). Construct an NFA for the state table below

8 0 1 qo {qo, q} {qo} q {q3} {q1, 43} {qo, 4} {q} 42 43 {q1, 42, 43}