Design a DFA that accepts all strings on {0, 1} that end in 0.

Design a DFA that accepts all strings on {0, 1} that contain the substring 11.

Design a DFA for the language L = {w {a, b, c} : every c is followed by ab }.

Design a DFA for the language L = {a 2i b 2j+1 : i, j 0}