The following NFA N accepts the language A of strings with a bb in them from the previous questions. Convert it to an equivalent DFA M, then modify M into a DFA M' such that L(M,) = A, which is the complement of A and was also mentioned above. Finally when you start converting M into a regular expression, which of the following 2-state GNFAs do you come down to