Can you please help me out with question number 5?

I would be really thankful if you could help me out with the details. I am really confused about this assignment. And please don't copy other answers to here.

5. Indicate whether or not the following NFA accepts the given strings. ( 1 is start. 3 is final.) itring IAAA IBBBB IBABA ABB ABAB ABBB 6. Minimize the following DFA. Draw the resulting minimized DFA. ( M is start, T and P are accepting.) 7. Convert the following regular expression into a NFA using the NFA construction method described in your text. Show all the states resulting from the construction. Regular Expression: (aba)* | bab*