There is a tiny programming language that you may not yet have heard of called Latchy. Each Latchy program statement (one line of Latchy code) consists of a 2-bit binary string. The strings 11, 10, and 01 are Latchy statements. The 2-bit binary string 00 is not a legal Latchy statement. The positions in the string have, in left to right order, the names S’ and R’.Yes, Latchy is the machine language of the S’R’ latch! The bit strings of a machine language, when presented to logic circuit inputs cause that circuit to execute the "instruction" represented by that bit string. Assume Latchy program statements are presented to the S" and R’ inputs of an S’R’ latch one per second, one at a time until reaching the final statement. The final statement bit string values are then sustained on the S’R’ inputs forever or until someone decides to turn off this little computer. Write a Latchy program that commands an S’R’ latch to emit exactly one rising edge on its output, the Q(t) wire. Provide an explanatory comment with each line of code. Correct function of your program must not require a particular initial latch state (initial Q(t) value). Make your program have as few lines of code as you can.