Create a circuit that compares the 4-bit, twos complement binary integers A and B for equality (equals) and the two strict inequalities (less-than and greater-than). When you imagine computing A-B, three possibilities result (1) A-B = 0 (lets associate the condition Zero with A equals B) ; (2) A-B < 0 (associate the Negative condition with A is less-than B); or (3) A-B > 0 (associate the Positive condition with A is greater-than B). Note Z, N, and P are famous condition codes. You are encouraged to read the text book Section 5.1.3 entitled Registers to learn more about the concept of condition codes. Use the attached SDL text file Problem9.sdl and the attached driver program Problem9.cpp. Please attach your SDL text file, Problem9.sdl, to the email you send to AHanna@StMaryTX.edu. You do not need to include a screen shot to prove your circuit design and its implementation are correct because Dr. Hanna plans to do the required testing. (base 2) (base 10) binary 2s complement 0000 0 0001 1 0010 2 0011 3 0100 4 0101 5 0110 6 0111 7 1000 -8 1001 -7 1010 -6 1011 -5 1100 -4 1101 -3 1110 -2 1111 -1.