My code has errors. 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. $\backslash$table$[[,$Test,Expected,Got,$],[x,\backslash$table$[[x0=3$right$\_$triangle:

SUB sp$,$ sp$,$ #$32$

STR x$0,[$sp$]$

STR x$1,[$sp$,$ #$8]$

STR x$2,[$sp$,$ #$16]$

STR lr$,[$sp$,$ #$24]$

MOV x$1,$ #$2$

LDR x$0,[$sp$]$

BL pow

MOV x$3,$ x$7$

LDR x$0,[$sp$,$ #$8]$

BL pow

MOV x$4,$ x$7$

LDR x$0,[$sp$,$ #$16]$

BL pow

MOV x$5,$ x$7$

LDR lr$,[$sp$,$ #$24]$

ADD x$6,$ x$3,$ x$4$

CMP x$6,$ x$5$

BEQ is$\_$right

ADD x$6,$ x$3,$ x$5$

CMP x$6,$ x$4$

BEQ is$\_$right

ADD x$6,$ x$4,$ x$5$

CMP x$6,$ x$3$

BEQ is$\_$right

MOV x$0,$ #$0$

B done

is$\_$right:

MOV x$0,$ #$1$

done:

LDR lr$,[$sp$,$ #$24]$

ADD sp$,$ sp$,$ #$32$

RET