please answer as soon as possible

mail.kpu.ca doesn't allow editing on a Mac. To learn more, contact your admin about your Office plan. 3. [6 points] Here is a problem that we would like to make a circuit for. Suppose that a circuit takes as input an unsigned 4-bit binary number (where the bits are denoted A,B,C and D with A being the left-most bit and D being the right-most bit). The output of the circuit (denoted as Z) is 1 if there are two l's in the input combination: false otherwise. For example, if input combination is 1001 then output will be 1 (there are other situations like 1100, 1010, and more) Similarly, if input combination is 1000 then output will be there are other situations like 1110,0111, 1111 and more). a. Convert the problem into a truth table using the table below. The input sequence MUST BE IN CORRECT ORDER Input Output A B C D z 1 0 0 0 1 1 0 0 1 1 1 1 1 1 1 1 0 1 0 1 Font 0 010 0100 0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 1 0 1 1 0 1 1 1 0 1 10 1 1 1 1 1 1 0 1 0 1 0 1 0 1 0 1 0 1 b. Write the Boolean expression for Z in SOP form. Ans.: A'B'C'D' + A'BC'D' + A'BCD + A B'C'D' + ABCD + AB CD' + AB'CD+ABCD+ ABC'D + ABCD + ABCD