Create a state diagram, state table, and the next-state equations mimicking the computer instruction cycle based off the following criteria:

Inputs: indirect, program-check, C1, clock

Outputs: fetch, decode, indirect, execute, trap, S1, S2

States: fetch, decode, indirect, execute, trap

State-transition: Occur with clock cycle. Each state cycles through two steps coincident with the clock (so the machine transitions to the fetch state at S1 (written fetch/S1) and them moves to the fetch state at S2 where it transitions as per the specification given below:

fetch S1. S2. if C1 goto fetch/S1 else goto decode/S1

decode S1. S2. if indirect then goto indirect/S1 else goto execute/S1

indirect S1. S2. goto execute/S1

execute S1. S2. if program-check then goto trap/S1 else goto fetch/S1

trap S1. S2. goto fetch/S1