In this last part of the assignment, you will once again be dealing with the circuit from part 1. As a reminder, here are the requirements for the circuit: The circuit should have four inputs: A, B, C, and D. The circuit should have two outputs: W and X The output w should be a 1 if and only if there aren't two adjacent 1s in the inputs (.e. A and B, B and C. or C and D). The output X should be a 1 if and only if there aren't two adjacent Os in the inputs. Suppose you do not minimize the expressions for the two outputs. In this problem, you will fill in a PLA that implements the circuit above. Getting Started One option to start is to download the Assigment 2 Part 3 starter PLAZ.(Make sure to right-click the link and click "Save Link As...") You will then have to edit it on your computer and then transfer it to hills using FileZilla or similar when you are ready to submit. Alternatively, on hills, you can find a starter file for a PLA diagram. You can copy it and edit it entirely on hills. To copy it into your current directory, you'll have to type: cp /pub/cs/jpotter/cs270/pla/a2p3.txt Don't forget the dot at the end! One note on the "cp" command - know that if you use it as shown above, the command will overwrite anything in your current directory with the name "a2p3.txt" You can then edit it with the text editor called nano. The Task To complete the PLA: For each intersection in the AND plane (where intersections occur between the input wires and each possible input value), replace vertical bars with a single x where appropriate. The input value 0 is done for you. For each intersection in the OR plane (where intersections occur between possible input values and outputs), replace vertical bars with a single x where appropriate Again, you should not do any minimization on either of the output variables for this problem. Each row in the truth table corresponds to a column in the PLA. The binary number represented by the four input variables can be matched with the equivalent decimal number above each column in the PLA.(The row with inputs 0000, for instance, can be matched with the column labeled 0, and the row with inputs 1001 can be matched with the column labeled 9.) To test your file, run the following command: mlade starter plas/a?na trt 705278/submit A2P3 a203.txt 1 0123456789101112131415 -1---|--|---|--|---|---|--|---|--|--|--|--|--|--|--|-- -x---|--|--|--|---|--|--|---|---|-- -|--|--|---|------|-- -|--|--|--|--|- |--|--|-- --|---|--|--|-- -x----- ---|--|- -1-1--- ----- ----|-- ----|-- - --- --- EARL============= In this last part of the assignment, you will once again be dealing with the circuit from part 1. As a reminder, here are the requirements for the circuit: The circuit should have four inputs: A, B, C, and D. The circuit should have two outputs: W and X The output w should be a 1 if and only if there aren't two adjacent 1s in the inputs (.e. A and B, B and C. or C and D). The output X should be a 1 if and only if there aren't two adjacent Os in the inputs. Suppose you do not minimize the expressions for the two outputs. In this problem, you will fill in a PLA that implements the circuit above. Getting Started One option to start is to download the Assigment 2 Part 3 starter PLAZ.(Make sure to right-click the link and click "Save Link As...") You will then have to edit it on your computer and then transfer it to hills using FileZilla or similar when you are ready to submit. Alternatively, on hills, you can find a starter file for a PLA diagram. You can copy it and edit it entirely on hills. To copy it into your current directory, you'll have to type: cp /pub/cs/jpotter/cs270/pla/a2p3.txt Don't forget the dot at the end! One note on the "cp" command - know that if you use it as shown above, the command will overwrite anything in your current directory with the name "a2p3.txt" You can then edit it with the text editor called nano. The Task To complete the PLA: For each intersection in the AND plane (where intersections occur between the input wires and each possible input value), replace vertical bars with a single x where appropriate. The input value 0 is done for you. For each intersection in the OR plane (where intersections occur between possible input values and outputs), replace vertical bars with a single x where appropriate Again, you should not do any minimization on either of the output variables for this problem. Each row in the truth table corresponds to a column in the PLA. The binary number represented by the four input variables can be matched with the equivalent decimal number above each column in the PLA.(The row with inputs 0000, for instance, can be matched with the column labeled 0, and the row with inputs 1001 can be matched with the column labeled 9.) To test your file, run the following command: mlade starter plas/a?na trt 705278/submit A2P3 a203.txt 1 0123456789101112131415 -1---|--|---|--|---|---|--|---|--|--|--|--|--|--|--|-- -x---|--|--|--|---|--|--|---|---|-- -|--|--|---|------|-- -|--|--|--|--|- |--|--|-- --|---|--|--|-- -x----- ---|--|- -1-1--- ----- ----|-- ----|-- - --- --- EARL=============