The original question asks for a proof that if L is regular then the language Shift(L) is also regular). Instead of a general proof, assume that the dfa for a specific regular language L is the following: b a a 91 dead 92 qo 93 14 b dead Create an nfa for the language Shift(L). Submit the JFLAP file. The original question asks for a proof that if L is regular then the language Shift(L) is also regular). Instead of a general proof, assume that the dfa for a specific regular language L is the following: b a a 91 dead 92 qo 93 14 b dead Create an nfa for the language Shift(L). Submit the JFLAP file