answer all 3 parts please

Q4. (5 marks) Execute the following instructions on MIPS Multicycle-FP pipeline without data forwarding. This version of MiPS uses instruction queue, ROB, and memory enhancements. We have infinite functional vinits. Execution length of each FU is as: WT S.D/. D =1CC MUI n.... WTT/S.D/A.D =1CCMuln cw. (v marks) Execute the following assembly code on a MIPS with scoreboard and register the respective cycle number in the table. The number of available unite arn infinic. c...... and register the respective Q6: (5 marks) Complete the following table using Tomasulo's Algorithm. Register all the stalls in the Comments column. Assume we have an infinite no. of reservation stations available with us. Observe the following lengths for different execution units: INT/S.D/L.D =1CC (1+1 in case of LD/SD i.e., 1Cc for address calculation and 1 for execution) FPMUL.D=12CC FP DIV.D =40CC FPADD.D/SUB.D=4CC