1. Let ={0,1} . For each part below, give the formal definition and state diagram for a deterministic finite automaton (DFA) that accepts the language specified. 32 points a) = { every even position of w is a 0 and every odd position of w is a 1} b) L2 = {wl number of 0s is a multiple of two and number of ls is a multiple of two} c) L w w begins with 101 and is odd in length) d) L4 is the empty set