3. Give nondeterministic finite automata accepting the set of strings of a's and b's such that there are two b's separated by a number of positions that is a multiple of 3. (Note: 0 is not an allowable multiple of 3, so bb is not in language while babab is). Try to take advantage of nondeterminism as much as possible