Given the transition graph GM of a finite accepter M shown below. a d) Find L(M). 0,1 1 0 Q 1,A Q a) Is G a DFA or a NFA? Explain your answer. b) Find two strings that are accepted by M. Write down the sequence of moves for which each string is accepted by M. c) Find two strings that are rejected by M. In which state can M stop after read each rejected string?