Consider the grammar G:

S $0$A $|1$B $|\backslash$Lambda

A $0$A $|1$

B $1$B $|0$

Mark the correct statements referring to the finite state machine that will recognize the language generated by this grammar. Incorrect marks will reduce your grade:

$1111$ is accepted by this machine.

$0010$ is accepted by this machine.

$0101$ is accepted by this machine.

The start state is an accepting state.

There are $4$ states in this NFA.

There are $3$ states in this NFA