(50 points) Draw diagrams of DFAs (deterministic finite automatons) that recognize the follow- ing languages. In all cases the input alphabet is (0,1). (a) A, 1,01) b) ww begins with a 1 and ends with a 0) (c)w w contains at least three 1s) (d) wevery character at an odd position of w is a 1) (e) fw w contains an even number of Os, or exactly two 1s)