Design a DFA for each of the following languages. Please draw the solutions

Like this

1 Design a DFA for the language over the alphabet {a, b} for all the strings with at least two occurrences of ba. The two occurrences can be anywhere in the string

2 Design a DFA over {0,1} for all the Strings with exactly one 1 and at least one 0.

3 Design a language L over {a,b} for all the strings starting with ab

4 Design a DFA over {0,1} for all the strings that beings with 0000 or ends with 1111