For all problems below, assume that inputs are available in both true and complemented forms. In addition, do not expand or simplify the original expressions using Boolean algebra. 3. For each pull-up/pull-down network below, give the Boolean expression and draw its pull-down/pull-up network. C a' a' b e b' a F b' (a) b' a (d) e d' d F b' a с (၁) F с

For the following question, you need to create a truth table, write the Boolean expression for each output based on the truth table, use K-map to simplify the expression if possible, and draw the logic diagram using AND, OR, NOT gate only. 1. Design a 3-bit shifter. a. A0, A1, A2, and S as inputs b. If S=0, then shift one bit to the left and add 0 to the last bit c. If S=1, then shift one bit to the right and add 0 to the first bit d. Y0, Y1, and Y2 as outputs

Using Boolean Algebra laws, rules, and theorems, simplify the expressions below. Please use a whiteboard!