I need help with this question.

Question 2 Which of the languages below are regular? If the language is regular, justify your answer by giving the corresponding regular grammar, regular expression, finite state automata, or by referring to lemmas given in the lecture (e.g. that finite languages are regular). If the language is not regular, give a brief informal explanation why this is the case, explicitly pointing to the reason (e.g. which numbers need to be equal) (i) (ab) an 2 0] (ii) {a"ban | n > 0} (iii a"ba 5) (iv) {a"b"a n2 0) (v) {(aba) n2 0 (vi) fwesa, b}* |w has an odd number of a's and an odd number of b's] 3 marks) 3 marks 3 marks 3 marks 3 marks [6 marks]