We have the following program segment executed on a three stage $($I$,$ E$,$ D$)$ RISC pipeline. The pipeline allows two simultaneous memory accesses.

$100$ LOAD R$1,$ X #Load from Address X

$101$ LOAD R$2,$ Y #Load from Address Y

$102$ INC R$1$ #Increment R$1$

$103$ DEC R$2$ #Decrement R$2$

$104$ BRANCH $,107$ #Branch to Address $107$

$105$ ADD R$1,5$ #Add $5$ to R$1$

$106$ SUB R$2,2$ #Subtract $2$ from R$2$

$107$ STORE R$2,$ Z #Store R$2$ at Address Z

Using delayed branch in pipeline operation in the above program, draw the pipeline timing diagrams:

i$-$ using NOOPS

ii$-$ after rearranging the instructions $($optimized delayed branch$)/$