15. Additional Problem 5-15 Figure 13 Answer all of the following questions for the NFA shown in Figure You do NOT need to specify the sequence of states that you vism the NFA shown in Figure 13 above Does it accept the string A o Does it accept the string a Does it accept the string b Does it accept the string C Does it accept the string aa Does it accept the string ab o Does it accept the string bb Does it accept the string bc Does it accept the string cc Does it accept the string aaa o Does it accept the string bbb Does it accept the string CCC Does it accept the string aab Does it accept the string bbc Does it accept the string cca Does it accept the string abb o Does it accept the string bcc o Does it accept the string caa o Does it accept the string abc Is the language of this NFA finite or infinite?? Give a set that represents what this NFA accepts Give a regular expression that represent what this NFA accepts Give a formal definition (as a 5-tuple like I do on the video!!) for this NFA (Be very careful about when you write curly braces and when you write parentheses, and also be very careful to use curly braces throughout your transition table!!)