Give nondeterministic finite automata accepting the set of strings of a$$s and b$$s such that there are

two a$$s separated by a number of positions that is a multiple of $2.($Note: $0$ is not an allowable multiple

of $2,$ so aa is not in language while abaab is$).$ Try to take advantage of nondeterminism as much as

possible.