$1.$How many cycles are required when executing the following codes in the pipelined implementation with data forwarding and control hazard optimization? To reduce the execution time, how can we rearrange the following codes? When do we rearrange the code, how many clock cycles are required? Please note that blt instruction operates same as beq instruction in terms of pipelining.

addi x$6,$ x$0,0$

addi x$29,$ x$0,100$

LOOP: $$ld x$7,0($x$10)$

add x$5,$ x$5,$ x$7$

addi x$10,$ x$10,8$

addi x$6,$ x$6,1$

blt x$6,$ x$29,$ LOOP