Problem $3.(20$ points$)$ Consider the following MIPS code fragment $($there are many

instructions between bne and move$)$:

Curr: bne $t$1,$ $t$2,$ Destination

$...$

$...$

$...$

Destination: move $t$1,$ $t$2$

What is the largest number of instructions that can we have in the program between the

current instruction and the instruction at Destination for the bne instruction to work

correctly? Why $?$