You are given the following class definition for an array-based List ADT: public abstract class List { protected int[] m_array; protected int m_index; 1 public List (int cap) ( 1 m_array = new int[cap]; m index - public abstract int sum(); // underlying array // index of the next open slot in Follow the steps below to create a concrete class EnhancedList with required instance variables and methods. 1. Make sure that the EnhancedList class inherits from List. 2. Declare two private instance variables: int m low and int m high which are used in one of the methods you are required to implement. 3. Create a constructor that takes two parameters int cap, int low, and int high. 4. The constructor should call the constructor of the super class and initialize the instance variable properly. 5. Create a void method rectify() that verifies if each element is with the range of [m_low, m_high]. If any element is smaller than =_low, change its value to m_low. Similarly, if any element is greater than m_high, change its value to m high. 6. Override the sum method so it computes and returns the sum of the elements on the list. Note: Don't forget to add the @Override keyword!

Draw a class diagram for the parking office class below. Diagram shoukd not be hand drawn. N.B Parking office class has relations and dependencies with car, customer, parkinglot and parking charge classes. public class ParkingOffice {String name;String address;String phone;List<Customer> customers;List<Car> cars;List<ParkingLot> lots;List<ParkingCharge> charges; public ParkingOffice(){customers = new ArrayList<>();cars = new ArrayList<>();lots = new ArrayList<>();charges = new ArrayList<>();}public Customer register() {Customer cust = new Customer(name,address,phone);customers.add(cust);return cust;}public Car register(Customer c,String licence, CarType t) {Car car = new Car(c,licence,t);cars.add(car);return car;}public Customer getCustomer(String name) {for(Customer cust : customers)if(cust.getName().equals(name))return cust;return null;}public double addCharge(ParkingCharge p) {charges.add(p);return p.amount;}public String[]…

Task 3: Implement method setup in PE1 class. The description of what is wanted is given in the starter code.   public class PE1 { MazedogMaze;  /** * This method sets up the maze using the given input argument * @param maze is a maze that is used to construct the dogMaze */     publicvoidsetup(String[][]maze){ /* insert your code here to create the dogMaze  * using the input argument.  */   }     /** * This method returns true if the number of  * gates in dogMaze >= 2.  * @return it returns true, if enough gate exists (at least 2), otherwise false. */ publicbooleanenoughGate(){ // insert your code here. Change the return value to fit your purpose.        returntrue; }   /** * This method finds a path from the entrance gate to  * the exit gate.  * @param row is the index of the row, where the entrance is. * @param column is the index of the column, where the entrance is. * @return it returns a string that contains the path from the start to the end.  * The return value should…

Task 3: Implement method setup in PE1 class. The description of what is wanted is given in the starter code.   TASK 1 and 2 are done in class maze. Please use PE1 class.   public class PE1 { MazedogMaze;  /** * This method sets up the maze using the given input argument * @param maze is a maze that is used to construct the dogMaze */     publicvoidsetup(String[][]maze){ /* insert your code here to create the dogMaze  * using the input argument.  */   }     /** * This method returns true if the number of  * gates in dogMaze >= 2.  * @return it returns true, if enough gate exists (at least 2), otherwise false. */ publicbooleanenoughGate(){ // insert your code here. Change the return value to fit your purpose.    if()   returntrue; }   /** * This method finds a path from the entrance gate to  * the exit gate.  * @param row is the index of the row, where the entrance is. * @param column is the index of the column, where the entrance is. * @return it returns a string that contains the…

8. Following is the node class: class node { int v node *next: public: node(int x) {v=x; next3D03;} friend class list: }3; Implement the sequential list class below: class list { // circular list class // head position node *head; public: bool empty() { return !head;} list() {head-0;} ~list(); void add(int x); int get(); // empty list judgment / constructor // destructor, to be implemented // add to tail, to be implemented // get from head, to be implemented }3B

Java (Generic Types) - Zip Code and Population

comptuer sciecne help

A) Write a generic Java queue class (a plain queue, not a priority queue). Then, call it GenericQueue, because the JDK already has an interface called Queue. This class must be able to create a queue of objects of any reference type. Consider the GenericStack class shown below for some hints.  Like the Stack class below, the GenericQueue should use an underlying ArrayList<E>.    Write these methods and any others you find useful: enqueue() adds an E to the queue peek() returns a reference to the object that has been in the queue the longest, without removing it from the queue dequeue() returns the E that has been in the queue the longest, and removes it from the queue contains(T t) returns true if the queue contains at least one object that is equal to t *in the sense that calling .equals() on the object with t the parameter returns true.* Otherwise contains returns false.  size() and isEmpty() are obvious.