Explain the stack storage allocation model.

In a stack-based allocation, all objects are allocated in last-in, first-out data structure and a stack. For example: Recursive subroutine parameters. A stack storage allocation model:

a. Grow and shrink on procedure calls and returns.

b. Register allocation works best for stack-allocated objects.

c. Memory allocation and freeing are partially predictable.

d. Restricted but easy and efficient.

e. Allocation is hierarchical: Memory freed in opposite sequence of allocation. It is If alloc (A) then alloc (B) then alloc (C), then this should be free(C) then free(B) then free(A).