Design a DFA for each of the following languages

1 Design a DFA over {0,1} for all the strings that starts with 1 and ends with zero

2 Design a DFA over {0,1} for all the strings ending with 100

3 Design a DFA for all the Strings where the second to the last symbol of the word is a b. Therefore, all the strings are ending with bb or ba

4 Design a DFA set of all the strings over {a, b } for all the string that the third symbol to the right is an a, meaning all the strings must end in the one of the following: abb, aaa, aab, aba