NFA question

Non-deterministic Finite Automata (NFA) 1. The above image depicts an NFA over the alphabet (pas) with two final states, indicated by double lines a. Give three words which are in the language of the NFA, and three which are no. b. In Maths, an NFA is 6-tuple (SJFA,TI,T2) where S is the set of Mates, i the initial state, F the set of final states, A the alphabet, TI the set of character transitions (given as triples, 4 (7A4)), and T2 the set of e-transitions (given as pairs,e-g.(3,8)).Write down the above NFA in this format eSuppose we made one of the three non-final states of the NFA (7,8 or 9) final as well. For which of those would that change the language of the NFA, and if so- give a word that's added bo the language