1 Boolean Algebra and Logisim Task 13 C D?Z Table 1: Truth table for ZI and z2 implementing this Boolean function in the The main rewult of this taok will be a logkcal cireuit correctl simalator. Each step as defined in the following sab-tasks needs to be documented and explained Step 1: Boolean Algebra Expressions (8 points) rite the Boolean equation foe your truth table in the two outputs Then, describe eac h single row in terns of Boolean algebra. Finally, combine the terms for rows into larger terms. Briefly explain these steps for the truth table given. Step 2: Logical circuit in Logisim (8 points) Model the resulting Boolean terms from Step 1 in a single Logisim circuit, using the basic gates AND, OR. NOT. You can use gates with more than two imputs. Explain what you did for each step. st your cireuit using values from the truth table and document the tests Step 3: Optimized circuit (9 points) The goal of this task is to find a minimal circuit using only universal gates (NAND gates). Based on the truth table and Boolean algebra terms from Step 1, optimize the function using Karnaugh maps .You will need to create two Karnaugh maps, one for each out put. Your documentation should show the maps as well as the groups found in the maps and how they relate to terms in the optimized Boolean function. (5 points) . Then use Logisim to create a minimal cireuit. Don't use any other gates than NAND. Test your optimized circuit using values from the truth table. (4 points)