The following function computes x" recursively, where x is an integer number and n is a non-negative integer number. int power (int x, unsigned int n) int y; if (n0) return 1i if (n & 1 return x * power (x, n - 1); else { y = power (x, n >> 1); return y*Y: Write an ARM assembly program to calculate x" using the above recursive function, where x and n are passed-by-value through the stack (not via registers) to the function and the returned value is just above the parameter. No other registers may be modified by the power function. Once the control is completely returned back from the function (i.e., after calculating x"), the returned value must be stored in a local variable (called resuli in the main function. Your code should be highly optimized. Use as few instructions as possible (as little as 45 assembly instructions only for both the main program and the function. NOT including any assembly directives or data definitions)!!. The following function computes x" recursively, where x is an integer number and n is a non-negative integer number. int power (int x, unsigned int n) int y; if (n0) return 1i if (n & 1 return x * power (x, n - 1); else { y = power (x, n >> 1); return y*Y: Write an ARM assembly program to calculate x" using the above recursive function, where x and n are passed-by-value through the stack (not via registers) to the function and the returned value is just above the parameter. No other registers may be modified by the power function. Once the control is completely returned back from the function (i.e., after calculating x"), the returned value must be stored in a local variable (called resuli in the main function. Your code should be highly optimized. Use as few instructions as possible (as little as 45 assembly instructions only for both the main program and the function. NOT including any assembly directives or data definitions)