Give a DFA for each of the following languages defined over the alphabet = {0, 1}:

a) (3 points) L={ w | w contains the substring 101 }.

b) (3 points) L={ w | w ends in 001 }.

c) (4 points) L={ w | w has a 1 in its 2nd last position, if such a position exists}.