three different questions, please

Consider the following NFA N. Which of the following strings does N accept? aba a ba b bab Consider the following NFA N. Suppose N reads the input string bab. Mark all the possible sequences of states N could visit. (s,q,r,r,s) (s,q,r,s) (s,q,s,r) (s,q,r,r) (s,q,r,s,q) (s,q,s,q) Consider the following NFA N. What is the set of states that N could be in after reading the string ? {s,r} {q} {s,q} {r} {q,r} {s} {s,q,r}