Assume a procedure with the label "pow:" has been defined elsewhere. With positive integer values in X$0$ and X$1,$ the "pow" procedure will calculate X$0$X$1,$ and leave the result in X$7.$

Write a procedure with label "right$\_$triangle" that will determine if the values in X$0,$ X$1,$ and X$2$ form the sides of a right triangle $($think Pythagorean Theorem, and you must use pow to compute the squares of the sides$).$ On return, set X$0==0$ if it is not a triangle, and X$0==1$ if it is$.$

Note: you may not assume X$2$ holds the longest side!

Warning: pow will zero all registers except X$7,$ so you'd better to store relevant values on the stack!

For convenience of debugging, a procedure labeled "debug:" has been defined which will print the values of all non$-$zero registers $($through x$29).$ Remove any calls to debug: for final submission. heres my code. it dont work: right$\_$triangle:

MOV X$1,$ #$2$

MOV X$0,$ X$0$

BL pow

MOV X$3,$ X$7$

MOV X$0,$ X$1$

BL pow

MOV X$4,$ X$7$

MOV X$0,$ X$2$

BL pow

MOV X$5,$ X$7$

ADD X$6,$ X$3,$ X$4$

CMP X$6,$ X$5$

BEQ found

ADD X$6,$ X$3,$ X$5$

CMP X$6,$ X$4$

BEQ found

ADD X$6,$ X$4,$ X$5$

CMP X$6,$ X$3$

BEQ found

MOV X$0,$ #$0$

B exit

found:

MOV X$0,$ #$1$

exit:

RET