Task $3$

The function find$\_$above$\_$instruction$\_$without$\_$dependencies$()$ scans a subset upward $($from bottom to top$)$ until an instruction with no data dependencies is found. This alone will not be enough to sufficiently check the subset for suitable instructions to swap, because when a suitable instruction is not found searching bottom to top, the search must be repeated from top to bottom.

Complete find$\_$above$\_$instruction$\_$without$\_$dependencies$().$

Note: When checking whether or not an instruction is truly dependency$-$free, we must check in both directions $($i$.$e$.,$ instruction$\_$A against instruction$\_$B and instruction$\_$B against instruction$\_$A$.$

The bidirectional check only applies to the intermediate instructions $($intermediate$\_$index$)$ but not the current instruction $($current$\_$index$).$ The current instruction is always below the test instruction $($test$\_$index$),$ even after swapping. Thus, you only need to compare the rd of the test instruction with the rs of the current instruction.