This is the problem before

For the code in the last problem, if the first call to the program is silly_recursion(8) how many bytes total will be stored on the stack (assume no last call stack optimization in your assembly)? For the following C code, what is the minimum number of bytes that need to be stored on the stack for each call. long long int silly_recursion (long long int x) return x silly_recursion(x>>1); else f return 0; For the code in the last problem, if the first call to the program is silly_recursion(8) how many bytes total will be stored on the stack (assume no last call stack optimization in your assembly)? For the following C code, what is the minimum number of bytes that need to be stored on the stack for each call. long long int silly_recursion (long long int x) return x silly_recursion(x>>1); else f return 0