Two variables length and width have already been associated with values. Write Python code to swap the values so that length is associated with the value previously associated with width and vice-versa. You may use other variables as necessary. (There's nothing special about Python here: most languages would do it the same way).

Give a CFG that generates the language defined by the regular expression ((ab* a) | (b(aa)*b))+ over the alphabet {a,b}. Show how you would modify your CFG for the regular expression ((ab*a) | (b(aaa)*b))+.

Design FSMs that will recognise the following languages. Some of these languagesare given simply as sets of strings (and hence there should be no doubt what themachine must recognise). Others are described using English, and there may wellbe a lack of clarity in these descriptions. You should make clear any assumptionsthat you have made in interpreting what the machine needs to do. The alphabetfor all the machines is {x,y, z}.1. {xy, xz}.2. Two x symbols followed by one y and zero or more zs.3. {xxy, xzy, xy}.4. At least one x followed by exactly one y followed by zero or more zs.

Draw a transition diagram for a Turning machine accepting the following language. L = The language of all non-palindromes over [a,b]