Write a procedure to reverse a linked stack implemented as a doubly linked list, with the original top and bottom positions of the stack reversed as bottom and top, respectively. For example, a linked stack S and its reversed version Se are shown as follows: grev 94 114 H 346 344 H 344 346 H 114 94

The ADT stack lets you peek at its top entry without removing it. For some applications of stacks, you also need to peek at the entry beneath the top entry without removing it. We will call such an operation peek2. If the stack has more than one entry, peek2 returns the second entry from the top without altering the stack. If the stack has fewer than two entries, peek2 throws an exception. Write a linked implementation of a stack class call First_Last_LinkStack.java that includes a method peek2

You are allowed to operate on a stack WORK and a temporary stack TEMP (ifneeded) supporting their ADT operations of PUSH (S,X), POP (S, X) andEMPTYSTACK (S) only, where X represents an element/variable to be pushed in orpopped out of the stack and S represents a stack. You are also permitted to use onevariable if needed to carry out the operations.i) Given n distinct random numbers that are to be pushed into WORK, how canyou find the minimum element that was pushed into it? You are permitted to use alone variable.ii) Given n distinct random numbers that are to be pushed into WORK, how canyou find the maximum element that was pushed into it, all the while ensuring thatthe elements stored in WORK are in their descending order with the maximumelement beginning at the bottom of stack? You are permitted to use a lone variableand a temporary stack TEMP.iii) Given an array A[1: n] of distinct random numbers how can you obtain thesorted list in the array, making use of stacks alone?

If a Stack is most optimally derived from a Singly Linked List, which node of the Linked List should be pointed to or will be referred to as the Top of the stack and why?

There is a data structure called a drop-out stack that behaveslike a stack in every respect except that if the stack size is n,then when the n+1 element is pushed, the first element is lost.Implement a drop-out stack using links

Implement a stack S using two queues Q1 and Q2 so that operations PUSH (S,X) and POP(S, Y), where S is supposedly a stack and X is the element to be insertedinto S and Y the element deleted from S, are worked upon by the queues that operatetogether as a stack. Assume that the ADT operations of ENQUEUE, DEQUEUE andEMPTYQUEUE are only available for the queues.Demonstrate the working of your method on a list {a, b, c}, which is to beoperated upon as a stack by the queues Q1 and Q2.

Write a push method for a stack implemented as a linked structure. You may assume that the implementation has the top element of the stack referenced by a LinearNode reference top and that an integer variable count keeps track of the number of elements in the stack. Hint: LinearNode class has a method called setNext which allows to reference a LinearNode object.

Given a stack, a function is consecutive takes a stack as a parameter and thatreturns whether or not the stack contains a sequence of consecutive integersstarting from the bottom of the stack (returning true if it does, returningfalse if it does not). For example:bottom [3, 4, 5, 6, 7] topThen the call of is_consecutive(s) should return true.bottom [3, 4, 6, 7] topThen the call of is_consecutive(s) should return false.bottom [3, 2, 1] top The function should return false due to reverse order. Note: There are 2 solutions:first_is_conse cutive: it uses a single stack as auxiliary storagesecond_is_cons ecutive: it uses a single queue as auxiliary storage

A counter automaton is a pushdown automaton that only uses one stack symbol (in additionto the bottom of the stack marker). This means that the stack acts as a simple counter: the push operationincreases the counter, the pop operation decreases it, and you can check if the counter is currently set to 0by looking for the bottom of the stack. In particular, you can not store a string over an arbitrary alphabeton the stack. For example, the automaton for anbn we have seen in class is a counter automaton.Let L = {w ∈{a, b}∗|w contains the same number of symbols a and b}.(2.a) Build a counter automaton accepting the language L. As in Question 1, describe the algorithmused by your automaton, and draw a transition diagram.(2.b) Write down an accepting computation of your automaton on the string abbbabaa.