Consider the following code sequence:

$$

addd $$f$12,$ f$5,$ f$4$; f$5+$ f$4->$ f$12$

multd f$6,$ f$12,$ f$10$ ; f$12*$ f$10->$ f$6$

multd f$8,$ f$12,$ f$7$ ; f$12*$ f$7->$ f$8$

$$

when executed on the Scoreboard based computer$$as compared to$$the same program fragment executed on the Tomasulo based computer.$$Carefully answer the following questions. In all the questions, you can simply assume both Scoreboard and Tomasulo computers have sufficient number of functional units, including at least one floating$-$point adder and two floating$-$point multipliers, for the execution of the above program fragment.

$$

When the $$addd$$ instruction already enters its EXEC stage, and is computing the value of f$12,$ clearly state whether the two subsequent $$multd$$ instructions can be issued or not$$for the execution of the above program fragment on EACH of the Scoreboard$/$Tomasulo$$s computer. In addition, for each $$yes$$ or $$no$$ answer you provide for each specific computer, give a short and concise explanation to justify your answer. For example, here is a sample format for your answer: $$

$1)$ for $$Scoreboard $$ No$,$ the two instructions cannot be issued BECAUSE $......$

$2)$ for $$Tomasulo $$ Yes, the two instructions can be issued BECAUSE $........$