Consider the Program segment
I1: r0 <- r1 + r2;
I2: r2 <- r0 * r3;
I3: r0 <- r2 / r0;
I4: r3 <- r2 * r0;
I5: M[x] <- r3;
Q1> Calculate the number of -
1. Read after write hazard
2. Write after Read hazard
3. Write after Write hazard.
Q2> which of these hazards happen between the two adjacents instructions.