debug a recursive function call on four different platforms: x86 Intel on Microsoft's Visual Studio, Raspberry Pi ARM processor 32 bit, MIPS on MARS Simulator, and on a 64-bit Intel processor running Linux. Display and explain all frames on stack. 2. Measure and plot the time it takes to compute Factorial (N), for N= 10, 100, 1000, 10,000. 3. Required part: Repeat tutorial example 1 and 2 to compute GCD(a,b) using recursive version of EUCLEDEAN algorithm for two integers a>0, b>0. To refresh GCD(a,b) computation please refer to last 3 pages of this assignment. 4. What to Submit: report, working project files and how to use, 2 min video presentation. Tutorial Example of a recursive procedure that calculates the factorial of a number and its code in both C and MIPS can be found in the textbook and is shown below. Create and explain Stack Frames for the recursive function call factorial(5) int factorial (int N) { if (N==1) return 1; return (N* factorial (N-1) ) ; } void main() { int N fact-factorial (5); } 1. Co