Please Solve with complete explanation.

Question 1 (9): Construct deterministic finite automata which recognise each of the following languages. You should represent each automaton in the form of a diagram. a) {w {a,b}* | each a in w is preceded by an odd number of occurrences of b} b) {W {a,b}* | w has even length, less than 5} c) {we {a,b}* | w has an even number of a's and an odd number of b's }