4. (6 points) Let N=({q0,q1,q2},{0,1},,q0,{q1}) be an NFA with given by the following table: (a) Draw the state diagram of N. (b) Use the subset construction to construct an equivalent DFA M. Draw the state diagram of M. You must label the states. You do not have to draw unreachable states of M. Do not otherwise simplify M. (4 points) Suppose L is a language over . Define a new language chop (L) that is formed by removing the first symbol from every string in L. That is, chop(L)={wvwL and v=1}. You will show that if L is a regular language, then chop(L) is also a regular language. Specifically, let DFA M=(Q,{a,b},,q0,F) be given. Define the formal components of an NFA N=(Q,{a,b},,q0,F) such that L(N)=chop(L(M))