A stack frame is a collection of contiguous memory locations in the stack segment. When a function is called, a corresponding stack frame is generated and pushed onto the stack.

The stack frame memory locations hold all the components its corresponding function needs to have on the stack. This means each function has its own stack frame holding everything pushed onto the stack for it$.$

Every time a function is called, a new stack frame is pushed onto the stack.

Every time a function returns from being called, its stack frame is popped off of the stack.

Given these facts, please provide answers to the following parts of this question. Please make sure each answer is no more than $2$ sentences long. Note that if an answer is more than $2$ sentences long, it will not be given credit.

a$)$ What memory address does the $sp register contain, the highest memory address value in a stack frame or the lowest memory address value in a stack frame? When stating your answer please use either the word "Highest" or the word "Lowest". $(2$ points$)$

b$)$ Assume that there is a program that has six functions $--$ main, f$1,$ f$2,$ f$3,$ f$4,$ and f$5.$ Also assume that main calls f$1,$ f$1$ calls f$2,$ f$2$ calls f$3,$ f$3$ calls f$4,$ and main calls f$5.$

What is the maximum number of stack frames this program will have on the stack? $(2\mathrm{.}5$ points$)$

What function has been called and is performing its programming logic when the maximum number of stack frames are on the stack? When stating your answer please state the function's name as main, f$1,$ f$2,$ f$3,$ f$4$ or f$5.(2\mathrm{.}5$ points$)$

Once f$5$ returns from being called, which function's stack frame has its lowest memory address value stored in the $sp register? When stating your answer please state the function's name as main, f$1,$ f$2,$ f$3,$ or f$4.(2$ points$)$

c$)$ Assuming a function has all of the components it needs on the stack by the time it is called, list all of the contents of a stack frame. In other words, list everything a function has pushed for it on the stack by the time it is called. $(8$ points$)$