Question $1$

Let us consider the following code segment:

ADD X$1,$ X$2,$ X$3$

SUB X$2,$ X$1,$ X$4$

LDUR X$3,[$X$5,\backslash$#$10]$

ADD X$6,$ X$3,$ X$2$

How many data hazards are there in this code?

Question $2$

In Question $1,$ if we use stalling to resolve every hazard, how many cycles will it take to finish the code sequence?

Question $3$

In Question $1,$ if we use both forwarding and stalling, how many cycles will it take to finish the code sequence?

The answer is not $5$ or $6$

Question $4$

data hazard require both stalling and forwarding