Match the following stack operations with their respective array-based counterparts:A. PushB. PopC. Peek (or Top)i. Adding an element to the stackii. Removing an element from the top of the stackiii. Examining the top element without removing ita)A - ii, B - i , C - iiib)A - iii, B - ii, C - ic)A - ii, B - ii, C - iiid)A - i, B - ii, C - iii

Sanjeev is in charge of managing a library's book storage, and he wants to create a program that simplifies this task. His goal is to implement a program that simulates a stack using an array.Help him in writing a program that provides the following functionality:Add Book ID to the Stack (Push): You can add a book ID to the top of the book stack. Remove Book ID from the Stack (Pop): You can remove the top book ID from the stack and display its details. If the stack is empty, you cannot remove any more book IDs.Display Books ID in the Stack (Display): You can view the books ID currently on the stack.Exit the Library: You can choose to exit the program.Input format :The input consists of integers corresponding to the operation that needs to be performed:Choice 1: Push the book onto the stack. If the choice is 1, the following input is a space-separated integer, representing the ID of the book to be pushed onto the stack.Choice 2: Pop the book ID from the stack.Choice 3: Display the book ID in the stack.Choice 4: Exit the program.Output format :The output displays messages according to the choice and the status of the stack:If the choice is 1, push the given book ID to the stack and display the corresponding message.If the choice is 2, pop the book ID from the stack and display the corresponding message.If the choice is 2, and if the stack is empty without any book ID, print "Stack Underflow"If the choice is 3, print the book IDs in the stack.If the choice is 3, and there are book IDs in the stack, print "Stack is empty"If the choice is 4, exit the program and display the corresponding message.If any other choice is entered, print "Invalid choice"

Problem Statement:Write a program that implements the Stack Data structure using ArraysThe operations performed on the Stack arePushPopPeekInput format:The first line of input contains the number of operations to be performed on the stackThe next lines contain the integers separated by space in which the first integer indicates the operation to be performed and the second integer contains the element to be pushed.1 ---> indicates the Push2 ---> indicates the Pop3 ---> indicates the PeekOutput format:Display every element after performing the peek operationDisplay the stack after performing all operations at the end.Sample Test Case:Input:61 21 31 4231 5Output:35 3 2Explanation:1 2 ---> 2 will be pushed1 3 ---> 3 will be pushed1 4 ---> 4 will be pushed2 ---> Last element(4) is popped3 ---> peek operation is performed which results in printing the top element of the stack i.e 31 5 ---> 5 will be pushed6 Operations are completedTherefore one peek operation is performed so the output is 3 and the final stack 5 3 2Note:If the stack is empty and when pop and peek are performed first, proceed to the next operation without displaying and modifying anything in the stack.If the stack is empty and nothing is pushed to the stack, Print Empty at the end.Sample Test CasesTest Case 1:Expected Output:61 21 31 4231 535·3·2

In an array implementation of a stack, we can include code that will automatically allocate more memory if every element of the array is occupied. Which stack operation should invoke this code? A. push B. pop C. peek D. poke E. none of the above

These operations are called on a Stack : push(8), push(1), push(6), push(7), pop(), pop(), pop(), push(2), pop(). What is the data at the top position?A7B6C8D2

In a linked list-based stack, which operation retrieves the element at the top of the stack?*1 pointa. Peekb. Popc. Accessd. Remove