Question #3. Assume you have a machine that has the following resources and executes Tomasulos algorithm. Unit # Res # Clock Cycles in Execution Stage Stations ALI ALU2 MULTIPLIER LOAD1 2 2 2 2 4 LOAD2 2 2 a) Complete the table below listing the clock cycle in which the instruction completes each particular stage (assume R2 is available). For this problem assume that you must write back first before you can start execution if an instruction is waiting for a result. Instr LD R1,0(R2) LD R3, #10(R2) ADD R4,R1.R3 MULT R5, R4.R.1 ADD R6, R1.R3 Issue Execute Write back b) What is the maximum number of instructions and their types that could be in progress within the CPU at any one time? c) The following is a list of operations that are performed during the issue stage. Explain why the order of these operations cannot be altered. What would happen if steps 2,3 were reversed? 1) Check if Reservation station available 2) Lookup source registers and copy either operand into V field or reservation station in to Q field 3) Rename destination register