The truth table you download describes a Boolean function with four input values
X1,X2,X3,X4 and two output values Z1,Z2.
Write the Boolean function as Boolean algebra terms using the Sum of Product (SOP) form.
First, think about how to deal with the two outputs. Then, describe each single row in terms of Boolean algebra. Finally, combine the terms for single rows into larger terms.
Briefly explain these steps for your particular truth table (e.g., explain for one particular row how you come up with the Boolean terms for that row, and then explain how you combine all rows). This explanation should be no more than a few sentences.
Also, write the Boolean function as Boolean algebra terms using the Product of Sum (POS) form with a brief explanation of steps (e.g. how you combine all rows).

This is the truth table

X1 X2 X3 X4 Z1 Z2
0 0 0 0 1 1
0 0 0 1 0 1
0 0 1 0 1 0
0 0 1 1 1 0
0 1 0 0 0 1
0 1 0 1 1 0
0 1 1 0 1 0
0 1 1 1 1 0
1 0 0 0 0 1
1 0 0 1 1 1
1 0 1 0 1 0
1 0 1 1 1 0
1 1 0 0 0 0
1 1 0 1 0 1
1 1 1 0 1 1
1 1 1 1 0 1

Model the resulting Boolean terms (using SOP form) from Task 2.1 in a single Logisim circuit, using only the basic gates AND, OR, NOT. You can use gates with more than two inputs. See the template on the next page for how to structure your circuit.
Briefly explain your construction (as for Step 1, a short explanation is enough). Test your circuit using values from the truth table and document at least 3 test cases. You
can take screenshots or your Logisim window to document the tests