(a) Give a state diagram NFA for the language A = {w {0, 1}* | w = = x11, x {0, 1}*}. (b) Construct a DFA D for A using the technique from class. Label the states of D with the appropriate subset of states of M. (c) Prove that L(D) = A. (d) Give a DFA for the language B = {w = {0, 1}* | w = 00x, x = {0, 1}*}. (e) Construct a DFA which recognizes AnB using the ideas for constructing AUB described in class. Each state should be labelled with the appropriate pair of states from A and B.