Question: ARM big endian Recursion is a method where the solution to a problem depends on solutions to smaller instances of the same problem. A function

ARM big endian
Recursion is a method where the solution to a problem depends on solutions to smaller instances of the same problem. A function is considered recursive if it calls itself. 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 yi if (n= 0) return 1 if (n & 1) return x power (x, n - 1); else y power (x, n >>1) return yY: 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 stored in the stack 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 resul in the main functionYour code should be highly optimized. Use as ferw 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)!!. Sketch the structure of the stack frame that you utilized in your program. You should utilize a big enough stack so that you can calculate x" for various n values. How many stack frames are needed to calculate Xn, when n = 0. 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1 1, and 12? Recursion is a method where the solution to a problem depends on solutions to smaller instances of the same problem. A function is considered recursive if it calls itself. 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 yi if (n= 0) return 1 if (n & 1) return x power (x, n - 1); else y power (x, n >>1) return yY: 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 stored in the stack 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 resul in the main functionYour code should be highly optimized. Use as ferw 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)!!. Sketch the structure of the stack frame that you utilized in your program. You should utilize a big enough stack so that you can calculate x" for various n values. How many stack frames are needed to calculate Xn, when n = 0. 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1 1, and 12
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
