Please, using the program logisim, follow all instructions closely. I'm really struggling and could use an explanation on how you managed to achieve this. I'm struggling and don't even know where to start with this one. Please complete it as the prompt asks and I will be so grateful if you could provide an explanation because I seriously have no clue. Thank you so much!
In class, we have talked about circuits that determine whether one n-bit binary number is less than (or greater than) another. For n = 2, we have seen how to construct a circuit for this task by deriving a sum or products expression from the truth table In this exercise you will construct a comparator by nesting circuits The first step is simple. Rather than compare two 2-bit binary numbers, we want you to construct a sub-circuit that compares two 1-bit binary numbers. Call it "compare1". Your compare1 circuit should have two outputs. The first output should be true or false depending on whether its first input (treated as a 1-digit binary number) is less than its second input. The second output should be true or false depending on whether its first input is equal to its second input. Next, construct a "compare2" circuit. This circuit will take 4 inputs which it will view as two 2-digit binary numbers. Like compare1, the compare2 circuit should have one output that indicates whether its first pair of inputs is less than its second pair of inputs and another output that indicates whether the pairs represent equal numbers. The compare2 circuit should be constructed using two compare1 circuits and whatever other simple gates (and, or, not, and) you need to do the job Finally, construct a "compare4" circuit. You should find the construction very similar to compare2. This time, you will use two compare2 circuits as building blocks (together with some other simple gates). In addition, in the "main" circuit of your project, connect input and output pins to a copy of your compare4 circuit in such a way that it can be tested using just your main project. In class, we have talked about circuits that determine whether one n-bit binary number is less than (or greater than) another. For n = 2, we have seen how to construct a circuit for this task by deriving a sum or products expression from the truth table In this exercise you will construct a comparator by nesting circuits The first step is simple. Rather than compare two 2-bit binary numbers, we want you to construct a sub-circuit that compares two 1-bit binary numbers. Call it "compare1". Your compare1 circuit should have two outputs. The first output should be true or false depending on whether its first input (treated as a 1-digit binary number) is less than its second input. The second output should be true or false depending on whether its first input is equal to its second input. Next, construct a "compare2" circuit. This circuit will take 4 inputs which it will view as two 2-digit binary numbers. Like compare1, the compare2 circuit should have one output that indicates whether its first pair of inputs is less than its second pair of inputs and another output that indicates whether the pairs represent equal numbers. The compare2 circuit should be constructed using two compare1 circuits and whatever other simple gates (and, or, not, and) you need to do the job Finally, construct a "compare4" circuit. You should find the construction very similar to compare2. This time, you will use two compare2 circuits as building blocks (together with some other simple gates). In addition, in the "main" circuit of your project, connect input and output pins to a copy of your compare4 circuit in such a way that it can be tested using just your main project
