Consider an NFA to recognize the set of all binary strings that have either odd number of $0$s$,$ or that the number of $1$s$$ is not a multiple of $3,$ but not both. $($a$)$ Draw the NFA with clear markings of all states including start and acceptance state$($s$).($b$)$ Simulate the NFA to show that string $010011$ will be accepted by the NFA. $($c$)$ Simulate the NFA to show that string $01010$ will not be accepted by the NFA. Draw out the diagram please by hand. I am confused