QUESTION 5 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) if (x>0) return x+silly_recursion(x>>1) ) else! return 0 16 QUESTION 6 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)? QUESTION 7 For the code in problem 5, the two items which must be stored on the stack are and