L = {w E {0,1)" I w is divisible by 3 but w/ is not divisible by 2} As usual, w is read msd first. Example: w = 1100 w = 1100,-12 w' = 0011, = 4 Thus w is not in the language because w is divisible by 2 Design a minimal DFA that establishes whether or not any strings are in L. If there are, find the first string, in a shortlex sense, that is