I need help with that

5. Let -ta, b). Write the function for the following (1) dfa ('Qu -Q) and (2) nfa (5,ra : Q x (BU {)) P(D) respectively. 92 92 6. Give the languages accepted by the dfa and nfa in the above 6 (1) and 6(2), respectively 7. (1) When is a language L called as regular? (2) (i) Prove language L = {"wb: we {a, b) *,n2 O} s regular by design an nfa to accept it. (ii) Write the function 8,a : Qx(})-, P(0) for your above nfa (iii) Convert the above the nfa to a dfa