Draw DFAs for languages ending with '11'. Each DFA must have no more than 4 states.

a) DFA for binary strings
b) DFA for palindrome strings
c) DFA for strings with alternating 0s and 1s
d) DFA for strings containing '11'