A processor goes through this sequence of states to execute an instruction (very similar to the example I did in Live Session 5) →Fetch → Decode → Execute → StoreResult After completing the current...

Computer science question

Extracted text: A processor goes through this sequence of states to execute an instruction (very similar to the example I did in Live Session 5) →Fetch → Decode → Execute → StoreResult After completing the current instruction, it returns back to Fetch and starts execution of the next instruction. 1. Draw the state diagram 2. Make the state assignments. 3. Derive the state table from the state diagram.