global start start: sp. #0x1000 // initialize sp mov mov bl SVC #2 , rsum #999 rsum: sub str str // A: record state of the stack cbz sp, sp. #16 // reserve space for x30 and x19 x30, sp] x19. [sp. #8] // save temp register // save link register mov sub bl add // e is n, return if e =. // copy n to w19 // recursive call rsum // add result an copy of n 1: ldr ldr add ret x19, [sp. #8] x30, [sp] sp. Sp. #16 restore x19 // restore link register // release stack storage // In the above code, rsum, will be called three times before the recursion finishes. Trace the execution of the above program and state the contents of the stack for the requested conditions If w0-2, what is the contents of the stack at point A:? If w0-1, what is the contents of the stack at point A:? lfwS- , what is the contents of the stack at point A: ? global start start: sp. #0x1000 // initialize sp mov mov bl SVC #2 , rsum #999 rsum: sub str str // A: record state of the stack cbz sp, sp. #16 // reserve space for x30 and x19 x30, sp] x19. [sp. #8] // save temp register // save link register mov sub bl add // e is n, return if e =. // copy n to w19 // recursive call rsum // add result an copy of n 1: ldr ldr add ret x19, [sp. #8] x30, [sp] sp. Sp. #16 restore x19 // restore link register // release stack storage // In the above code, rsum, will be called three times before the recursion finishes. Trace the execution of the above program and state the contents of the stack for the requested conditions If w0-2, what is the contents of the stack at point A:? If w0-1, what is the contents of the stack at point A:? lfwS- , what is the contents of the stack at point A