#3 and #4 please

1. Draw diagrams of DFAs that recognize the following languages. In all cases the input alphabet is = {0,1}. {w/w begins with a 1 and ends with a 0} {w\w contains at least three Is} {w every character at an odd position of w is a 1} {ww contains an even number of Os, or exactly two 1s} 2. Give regular expressions for all four languages in Exercise 1 above. 3. Give an NFA with six states that recognizes the last language in the previous exercise. 4. Convert following NFA's to DFA's