() L1 = { w belongs to {a,b}* | the number of a's in w is a multiple of 3}

b) L2={w belongs to {a,b}* | w ends with a}

i) Create DFA or NFA that recognises the languages L1-A1,L2-A2

ii) Convert the automato A1 so as to recognise the language L1' (complement)

ii) Create DFA or NFA that recognises the language L={w belongs to{a,b}* | the number of a's in w is NOT a multiple of 3 and w ands with a}.