The MWT introduced in class has an array of pointers to children nodes in each node, and the index is used to indicate the letter on the edge. If instead we use a BST (each BST node contains a letter, a corresponding child MWT node pointer) in each MWT node, explain the advantages and disadvantages of this new “MWT” compared to the one introduced in class.

Specify and implement an iterator method called sortedElements for IntSet. The iterator method sortedElements returns an iterator that will produce each element of the intset in ascending order. The intset cannot be mutated when the iterator is in use.      Be sure to specify the iterator method before implementation. Do not forget to give the rep invariant and abstraction function for your implementation.   Note: IntSet.java has been provided.  You can directly add in the code the specification, the implementation of the iterator method sortedElements, and the inner iterator class.      There is a segment of simple testing code for sortedElements in main() close to the end in the provided IntSet.java.  The program will not compile until you have properly implemented sortedElements. find the provided code below: https://drive.google.com/open?id=1hANO8kVigGXwFLLJDJQLE5joM1BBeCCn

Define the abstract base class LinkedSQD_Base using a linked implementation. Indicate whether each field and method should be public, protected, or private, and explain why. Implement each of the ADTs stack, queue, and deque as a class that extends your base class. Repeat parts a and b, but instead define and use the abstract base class ArraySQD_Base using an array-based implementation. Java program

Create an implementation of each LinkedList, Queue Stack interface provided For each implementation create a tester to verify the implementation of thatdata structure performs as expected Your task is to: Implement the LinkedList interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in the test harness Create a client ( a class with a main ) ‘StagBusClient’ which builds a bus route by performing the following operations on your linked list: Create (insert) 4 stations List the stations Check if a station is in the list (print result) Check for a station that exists, and one that doesn’t Remove a station List the stations Add a station before another station. List the stations Add a station after another station. Print the stations StagBusClient.java package app;  import linkedList.LinkedList; import linkedList.LinkedListImpl; public class StagBusClient { public static void main(String[] args) { // create…