Use a stack and build a Fibonacci sequence on the stack. The program’s command line should take the number of Fibonacci elements desired, and you should have a loop that looks at the last two elements on the stack and pushes a new one for every pass through the loop.   in c++

Use c++ Q1. Create a library management system in which you have a pile of 4 books stacked over one another. Each book has a book number. Make a program in which a librarian stacks a pile of books over one another. A student wants to issue a book. The program first searches if the book is present in the stack or not. If the book hasn't been issued, the program finds out the index of the book. It also pops other books on the top of it to issue the book to the student. Display the books in the stack. (Hint: report the count of the books above the required book and use the pop() function "count" times.)

The destination of a function's return value may be represented as a sequence of instructions. When making modifications to the stack, keep in mind that they must not prevent the method from returning to its caller.