A) Consider the alphabet = {0,1,0,1}. Draw an NFA for the following language:

{w |w contains exactly one character from {0,1}, and w is a binary encoding of a multiple of 3, if you ignore the bars over characters}

B) Construct an NFA for the following language: {w {0,1} | there is a way to flip exactly 1 bit in w to get a multiple of 3}

For example, 1011 should be accepted since flipping the second bit gives 1111, which is a multiple of 3. 1010 should not be accepted, since none of {0010,0110,1000,1011} are a multiple of 3.