5. [10pt] (Submit JFLAP files and a print out on your HW answers showing accepted/rejected strings) Provide the state diagram for a DFA that recognizes the following language: {w = {0,1}* | w does not start with the substring 000 but ends with the substring 11}. Hint: You may want to solve Group Exercise 3 before attempting this question. 6. [10pt] For languages A and B, let the shuffle of A and B be the language {ww = a1ba2b2..arbk, where @1az... 0 A and b1b2... bke B, each ai, b; *}. Show that the class of regular languages is closed under shuffle. 5. [10pt] (Submit JFLAP files and a print out on your HW answers showing accepted/rejected strings) Provide the state diagram for a DFA that recognizes the following language: {w = {0,1}* | w does not start with the substring 000 but ends with the substring 11}. Hint: You may want to solve Group Exercise 3 before attempting this question. 6. [10pt] For languages A and B, let the shuffle of A and B be the language {ww = a1ba2b2..arbk, where @1az... 0 A and b1b2... bke B, each ai, b; *}. Show that the class of regular languages is closed under shuffle