2. Show that the class of regular languages over the alphabet 0,1 s closed under the operation FlipBits(L), defined as FlipBits(L) = {w w can be obtained from some w' in L by flipping each 0 in w, to l and each l to 0 A full proof would have three stages: setup, construction, and proof of correctness. In this exercise you will focus on the setup and construction, and then apply your construction to an example. Setup Consider an arbitrary DFA M = (Q, {0,1}, ,q, F), and call the language of this DFA L. Construction Build a new DFA whose language is FlipBits(L). To do so, ll in the blanks where Q'= This will be the set of states for your new machine For each possible input to the transition function, specify the output Notice that r is a state in Q and ar e 10,1) What is the initial state of M'? Make sure you choose an element of Q What is the set of accepting states of M'? Choose a subset of Q (r-?)N