2. 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 the 4-bit binary number is between 0100, and 1011, (both inclusive), O otherwise. 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 i. j. Write the Boolean expression for Z in SOP form. k. Simplify the expression from part b. Simplified expression may remain in SOP form. 1. Draw the circuit for the simplified expression for Z using LogicGates.jar app. Take a snapshot of that circuit and paste below. Test your circuit in the app so that it matches the truth table for the problem above before you paste your circuit