Problem 1 (6 points) For the following boolean expression: 1. Reduce the Boolean expression. 2. Draw the logic circuit for the logic expression. 3. List the truth table for this expression. (2 points) (2 points) (2 points) Problem 2: Logical operations on a string of bits are called bitwise operations. Given the following two 4-bit strings A = 1010 and B 1001, what is the result of performing each of the following bitwise logical operations: 6 points 1. A AND B (2 points) . A XOR B (2 points) 3. NOT A (2 points) Hint: Example of applying bitwise OR 1010 001 OR) 1011