There is a tiny programming language that you may not yet have heard of called Latchy. The bit strings 11, 10, and 01 form the entire set of valid Latchy language statements. The bit positions in a Latchy statement have, from left to right, the names S and R. Yes, Latchy is the machine language of the SR latch circuit! The bit strings of a machine language for a logic circuit, when presented to the inputs of that circuit, cause the circuit to execute the instruction represented, or encoded, by that bit string. Latchy programs consist of a sequence of Latchy statements. Each Latchy statement may be followed by a semicolon and a comment. Assume Latchy program statements are presented to the S and R inputs of an SR latch one at a time until reaching the final program statement. The final statement bit values are then sustained on the SR latch inputs forever or until someone decides to turn off this little computer.

1) Write a Latchy program that commands an SR latch to emit exactly one falling edge on its output, the Q(t) wire. Provide an explanatory comment with each line of code. Your program must command desired latch behavior regardless of initial latch state (initial Q(t) value). Make your program have as few lines of code as you can.

2) Assume that each statement of your Latchy program is stored in a 2-bit register. What is the minimum size pointer bit string that can be used to fetch a statement of your Latchy program? Express your answer as an integer in terms of the number of Latchy statements in your program presented as the answer to the previous question.