Implement the provided Queue interface ( fill out the implementation shell). Put your implementation through its paces by exercising each of the methods in a test harness. Add to your ‘StagBusClient’ the following functionality using your Queue. -Create (enqueue) 6 riders by name. Iterate over the queue, print all riders -Peek at the queue / print the result -Remove (dequeue) the head of the queue. Iterate over the queue, print all riders -Add two more riders to the queue -Peek at the queue & print the result -Remove the head & print the result. Iterate over the queue, print all riders StagBusClient.java package app; import queue.Queue; import queue.QueueImpl; public class StagBusClient { public static void main(String[] args) { // create implementation, then   //QueueRunTestMethod... System.out.println("----Q U E U E T E S T-------"); //StackRunTestMethod...   } } Queue.java package queue; public interface Queue { boolean isFull() ; boolean isEmpty(); // insert elements to the queue void enQueue(String element); // delete element from the queue String deQueue(); // display element of the queue void display(); //display 'first' element public String peek(); } QueueImpl.java package queue; public class QueueImpl implements Queue {   } QueueTester package queue; public class QueueTester { public static void main(String[] args) {   } }

import java.util.HashMap; import java.util.Map; public class LinearSearchMap {     // Define a method that takes in a map and a target value as parameters     public static boolean linearSearch(Map<String, Integer> map, int target) {         // Iterate through each entry in the map         for () {             // Check if the value of the current entry is equal to the target             if () {                 // If the value is equal to the target, return true             }         }         // If no entry with the target value is found, return false     }     public static void main(String[] args) {         // Create a HashMap of strings and integers         Map<String, Integer> numbers = new HashMap<>();         // Populate the HashMap with key-value pairs         numbers.put("One", 1);         numbers.put("Two", 2);         numbers.put("Three", 3);         numbers.put("Four", 4);         numbers.put("Five", 5);         // Set the target value to search for…

Given the MileageTrackerNode class, complete main() in the MileageTrackerLinkedList class to insert nodes into a linked list (using the insertAfter() method). The first user-input value is the number of nodes in the linked list. Use the printNodeData() method to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 public class MileageTrackerNode {   private double miles;         // Node data                                                            private String date;          // Node data   private MileageTrackerNode nextNodeRef; // Reference to the next node                                  public MileageTrackerNode() {      miles = 0.0;      date = "";      nextNodeRef = null;   }    // Constructor                                                                                        public MileageTrackerNode(double milesInit, String dateInit) {      this.miles =…

in java please.Create a method from the implementation perspective. Create a method where it takes in a linked chain of values and adds them in order to the front.  method header:public void addToFront(ANode<T> first)