problem 4: Tomasulo (20 points) in this question you are required to show one cycle of the Tomasulo algorithm on a piece show the instructions issued in the first cycle using the Tomasulo algorithm. contents of the reservation station (RS) entries, register file contents, tags or fields) for each dispatch to each reservation station, indicate which instruction is executing in each functional unit. Second, show what happens at the end of the third cycle. Use the notation you are familiar with. Assume the following architecture characteristics, state any other Your answer must include value operands (data most asumptions you make: Four issue processor ue processor (i.e, you can dispatch four instructions in each cycle) with in-order isue (i.e., no re-order buffer). execution latency (after issue) is 1 cycle for ADD and 2 cycles for MULT (multiplication). The result produced by an execution unit, and the execution unit, is available for use in the cycle immediately following completion of execution.(For example, if an add unit completes executio at end of cycle 2 then an instruction using this result can start execution in cycle 3.) Note that this information is not really needed to specify what happens only in the first cycle there are 2 reservation stations for ADD with tags 1 and 2, and 2 reservation stations for MUL with tags 3 and 4. But there is only 1 add execution unit and 1 multiplication execution unit. Initially: RO-6,R1-10, R2-10, , R3-3.5, R4-10, RS+7.8, R6:0 B: R3R1 RO; C: R3 = R2 + R3 ; D: R4 = R2 + R0; E: R5 = R3 * R4; F: R6 R2R1