Let swap: {a, 6}* rightarrow {a, b}* be the function that exchanges the a's and b's in a string. For example, swap(baaba) = abbab and swap(aaaa) = bbbb. For L a language over {a, b}, define swap(L) as follows: swap(L) = {swap(w) | w Element L}. Suppose A = {e, b, aabb, babababb}. What is swap(A)? You will now show that the class of regular languages over {a, b} is closed under the swap operator. Let M = (Q, {a, 6}, 6, q_0, F) be a DFA. Define DFA M' such that L(M') = swap(L(M))