Construct deterministic finite automata accepting each of the following lan- guages. (a) [w {a,b}" : each a in w is immediately preceded by a b}. (b) {w (a,b)* w has abab as a substring}. (c) {w {a,b}* : w has neither aa nor bb as a substring}. (d) {we {a,b}*: w has an odd number of a's and an even number of b's}. (e) {we {a,b)*: w has both ab and ba as substrings}.