1. (Course text exercise 2.2.4) For each case below, design a DFA A over the alphabet = {0, 1} that will recognize the language L(A):

(a)

L(A) = {w|w ends in 00}

(b)

L(A) = {w|w contains the substring 000}

(c)

L(A) = {w|w contains the substring 011}