Computer Architecture Homework 2 (100 pts): (must show your work) 1 Simplify expressions for the Boolean function defined by each of the following K-maps and draw the circuit(logic) diagram by using the basic gates. (25 pts) 1) 2) 3) 4) 5) 6) Page | 1 7 The truth table of a D flip-flop is given by Again, assume it is rising edge-triggered, which means the state Q will change on the rising edge of the clock signal, and the initial state of Q is 0 . Given signal D as it changes with time, draw the timing diagram for Q on the diagram below to show its changes with respect to D. (5 pts) Page | 3