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 You wil show that if L is a regular language, then chop(L) is also a regular language. Specifically, let DFA M (Q, {a,b),,go,F) be given. Define the formal components of an NFA -(Q', {a, b), y,%-F') such that L(N)-chop(L(M))