Task:

Design a combinational logic circuit that solves the following problem:

Output will be HIGH $(1)$ when two binary numbers x$1$x$0$ and y$1$y$0$ are equal. The notation x$1$x$0$ represents a two$-$bit binary number that can have any value $(00,01,10,$ or $11)$; for example, when x$1=1$ and x$0=0,$ the binary number is $10,$ and so on$.$ Similarly, y$1$y$0$ represents another two$-$bit binary number. Your combinational logic circuit, using x$1,$ x$0,$ y$1,$ y$0$ as inputs, will output a $1$ when the two binary numbers x$1$x$0$ and y$1$y$0$ are equal.

Complete each of the $8$ steps $($using PETGUI$),$ copy it to ONE document, save as ONE pdf$,$ and SUBMIT ASSIGNMENT.

In order to get credit for this assignment, you must use PETGUI.

Set up the truth table,

Write Sum$-$of$-$products $($SOP$)$ expression from the truth table $($sum$-$or$-$minterms form$).$

$4.$Create the Product$-$of$-$sums $($POS$)$ from the truth table $($product$-$of$-$maxterms form$).$

Now instead of using a simplification process, determine how you could use XOR or XNOR gates to implement the solution $-$ you may need $1$ AND, OR or NOT gate to be successful.

Create a simplified circuit diagram using XOR or XNOR gates.