Determine the output of the following Pep/9 machine-language program. The left column in each part is the memory address of the first byte on the line: 0000 C1000C 0003 18 0004 F1000B 0007 51000B 000A 00 000B 00 000C FOD4

Find the regular expression corresponding to Fig. 5.17. 1 91 92 1 1 94 93 Fig. 5.17 Finite automaton

a. Demonstrate that the disc motions employed in the Towers of Hanoi puzzle's traditional recursive technique may be utilised to generate the binary reflected Gray code.b. Demonstrate how to solve the Towers of Hanoi problem using the binary reflected Gray code.

Attach code and output.

Use recursive functions only Python only** onlyAU - Given an RNA sequence, returns a new sequence consisting of only the 'A' and 'U' bases from the original sequence with the 'C' and 'G' bases removed.    Define onlyAU with 1 parameter Use def to define onlyAU with 1 parameter   Do not use any kind of loop Within the definition of onlyAU with 1 parameter, do not use any kind of loop.   Use a return statement Within the definition of onlyAU with 1 parameter, use return _ in at least one place.   Call onlyAU Within the definition of onlyAU with 1 parameter, call onlyAU in at least one place.