Question $1)$ Consider the following sequence of instructions:

I$0$: DIV F$0,$ F$1,$ F$1$

I$1$: ADD F$3,$ F$0,$ F$2$

I$2$: STORE F$3,0($R$1)$

I$3$: SUB F$2,$ F$0,$ F$4$

I$4$: MUL F$3,$ F$4,$ F$2$

Q$1-1)$ Write all dependencies $($RAW$,$ WAR, WAW$)$ that exist in the program

ex$)$ RAW, I$5-$I$6,$ F$10$

Q$1-2)$ Now we try to resolve as many dependencies as possible through register renaming.

Rewrite the instructions assuming we have an infinite number of registers $($you may omit the

instructions that do not require register renaming$).$