3. One of the main uses of stacks is in recursive function calls, where each recursive function call represents a push to the system’s stack, and each return represents a pop from the system’s stack For example, Fibonacci sequence can be constructed using a stack rather than a recursive call. Fibonacci stack will start by pushing the first two Fibonacci numbers F(0) and F(1), then any F(n) can be obtained by popping the top
OR
OR