C$)$ ADT Algorithms $(15$ points$)$

Imagine a linked implementation of the ADT stack that places the top entry of the stack at the end of a chain of linked nodes. Describe how you can define the stack operations push, pop, and peek so that they do not traverse the chain. $(5$ points$)$

Write a pseudocode for an algorithm that read an even number of characters. The algorithm then prints the first character, third character, first character, and so on$.$ On the second output line the algorithm prints the other character. Use two queues to store the characters. $(5$ points$)$

Write a class definition that could be used to define a node in a doubly linked list. Include only the instance variables, not the methods. Also write one sentence to describe a situation when a doubly linked list is appropriate. $(5$ points$)$