8. Fill in the control word table for implementing the following algorithm on the General Datapath with a minimal possible number of cycles. Algorithm implements one time only and stops after outputting. Design the condition logic and show where and how it connects to the datapath. Draw the state graph. Input A Input B Input C If A=B and C