1. (13 points) Consider the following sets representing computational problems F_ {(M) I M is a DFA over {a,b) and L(M)0) Po (M) | is a DFA over {a,b) and IL(M)-1) F-(M) I M is a DFA over {a,b) and L(M) is finite) -(M)M is a DFA over (a, b) and ab e L(M)) P (M, M)M and M are both DFA over a, b) and L(M) L(M)) Po = {(M, M') I M and M, are both DFA over {a, b} and L(M) L(M,)) (a) For the DFA M with the given state diagram, list all and only P such that (M) E where 1 is6). 43 State diagram of M Q0 State diagram of M State diagram of Ms (b) For the DFA M2 with the given state diagram, list all and only P such that(M) P where 1 sis6) (c) For the DFA Ms with the given state diagram, list all and only P such that (M) E P (where 1 sis6) (d) Which one of the following statements is true