Question $3$

Which description best fits the depicted machine:

All binary strings with the property that in every prefix, the number of $0$ s and the number of $1$ differ by at most $2.$

An NFA that accepts the language defined by: $(01{)}^{*}01(0110^{*}){11}^{*}.$

Binary strings in which $000$ occurs at least once or $00$ occurs at least twice.

Binary strings in which the $1000$ th symbol from the end is a $1.$

Binary strings in which the number of $0$ s and the number of $1$ s is both even.

Binary strings in which there is a pair of Os separated by a number of positions that is a multiple of $4.$

Binary strings where the final symbol has appeared before.