Suppose that N-Q. T, qo, ,{qF is an NFA with only one final state non-initial state qF-For (g,x) E Q (}), define Prove that def (1) NR- (Q, ,JF, , {qo} ) is an NFA. (2) if you reverse a walk of N, then we get a walk in NR. and their labels are the reverse string of one another. (3) L()r_L(NR). Suppose that N-Q. T, qo, ,{qF is an NFA with only one final state non-initial state qF-For (g,x) E Q (}), define Prove that def (1) NR- (Q, ,JF, , {qo} ) is an NFA. (2) if you reverse a walk of N, then we get a walk in NR. and their labels are the reverse string of one another. (3) L()r_L(NR)