Computer Archecture problem. No programming invovled. Above is assembly languge please help on question.

Introduction to Computer Architecture Interstage Registers Consider the following set of assembly language instructions and data: Assuming that the interstage registers are all zeroed at the beginning, show the state of all of the registers for the nine cycles that it takes for all five instructions to move through the pipeline. You may leave the values in sensible terms, you do not need to covert the data to binary