Q# 1, Why did our implementation of a linked list use an empty node instead of null? Group of answer choices 1. To take advantage of a common protocol 2. To avoid possible null pointer exceptions 3. All of these 4. It helps in implementing several operations   Q# The purpose of an Abstract Data Type is Group of answer choices 1. To allow for a structure to be mutable 2. To represent the structure as a whole, rather than a single node 3. To allow implementation details to be hidden from the user 4. All of the above

What is the difference between a stack and a queue in computer science, and how are they implemented? Provide examples of scenarios where using a stack or a queue would be the most appropriate data structure choice.

1. Implementation of hostel management system showing Binary search tree (BST) using C++ programming language and 2. Used Splay tree, instead of BST with the same Language (C++).

1. Write code to define LinkedQueue<T> and CircularArrayQueue<T> classes which willimplement QueueADT<T> interface. Note that LinkedQueue<T> and CircularArrayQueue<T>will use linked structure and circular array structure, respectively, to define the followingmethods.(i) public void enqueue(T element); //Add an element at the rear of a queue(ii) public T dequeue(); //Remove and return the front element of the queue(iii) public T first(); //return the front element of the queue without removing it(iv) public boolean isEmpty(); //Return True if the queue is empty(v) public int size(); //Return the number of elements in the queue(vi) public String toString();//Print all the elements of the queuea. Create an object of LinkedQueue<String> class and then add some names of your friendsin the queue and perform some dequeue operations. At the end, check the queue sizeand print the entire queue.b. Create an object from CircularArrayQueue<T> class and…