Select the correct answerUsing Pop (S1,Item) ,Push(S1, Item), Getlist(Item), Pop(S2,Item), and the variables S1,S2(stacks with Top1 and Top2) and Item and given the input file: A,B,C,D,E,F Which stack are possible?OptionsAll possible stacks with A,B,C,D,E and FExact and only those stacks which can be produced with S1 aloneTwice as many stacks as can be produced with S1 aloneNo possible stacks with A,B,C,D,E and F

Select the correct answerUsingPop(S1, Item)Push(S1,Item)Read(Item)Print(Item)the variables S1 represents (stack) and Item are given the input file:A,B,C,D,E,F <EOF>Which stacks are possible:Options5    A4    B3    C2    D1    E54  3   F2   D1   B543   C2   E1   B5  4  3   D2   A1   FFinish ClearPrev

Objectives - Learn stacksUsing ArrayCreate a program to implement a stack by using array1) You have to get the user choice using keyboard as follows in the main functionChoices1. Push2. Pop3. Print all the elements of the stack4. Print the top element of the stack5. Exit2) Implement functions one by one according to each choice3) Using a switch case complete the code.Using Linked-listDo the above exercise using singly linked list

Select the correct answerA stack is implemented with an array of 'A [0..N - 1]' and a varlable 'pos'. The push and pop operations are defined by the following code.push(x) A[pos] ← X pos ← pos - 1end pushpop( ) pos ← pos + 1 return A[pos]end popWhich of the following will initialize an empty stack with capacity N for the above Implementation?Optionspos ← −1pos ← 1pos ← N−1pos

Select the correct answerA Stack can be implemented by using both ________ and ________.OptionsArrays, Linked listGraph, Linked ListQueue, GraphQueues, Trees

Select the correct answerStack M has the entries 1,2,3(with a on top).Stack N is empty.An entry popped out of stack M can be printed immediately or pushed to stack N.An entry popped out of the stack N can only be printed. In this arrangement, which of the following permutations of 1,2,3 are not possible?Options1,2,32,1,33,2,13,1,2