Instructions:

PriorityCustomer.java

/*

Program: CustomerQueue ~ PriorityCustomer Class

Date:

Summary: Creates a Customer object to be used in the line queue. Holds the serviceTime for each customer.

Functionality:

Constructor: Random ServiceTime (1-5)

Public Methods: getServiceTime, newMinute

*/

import java.util.Random;

public class PriorityCustomer {

private int serviceTime; // ServiceTime for this Customer

private int priority; // Priority for this Customer

/// Constructor

public PriorityCustomer() {

serviceTime = new Random().nextInt(5) + 1; // Randomly assign required service time 1-5

priority = new Random().nextInt(5) + 1; // Randomly assign priority 1-5

}

public int getPriority(){

return priority;

}

/// Getter for ServiceTime

public int getServiceTime() {

return serviceTime;

}

/// Decrement ServiceTime by 1

public void decServiceTime() {

serviceTime--;

}

}

A PriorityCustomer class is provided for you below. You must use that class, without alternations, for the creation of your PriorityCustomer objects. You must analyze the class and use the provided methods to achieve the desired functionality of the program. You will also need to create two additional classes. The first will be a RriorityQueue class that will represent the data structure for holding your Customer objects. In your PriorityQueue class, you will create the actual heap that will act as the priority queue. You must use an array representation of a heap. No Arrayists or linked structures! The second class you will need to create is a driver where vour store simulation will take place Customers with a priority value higher than other existing customers should be placed in front of them. This is simulated by utilizing a Max Heap to implement your priority queue. The only exception to this is for the customer in the front of the line (the one currently being serviced). If a new customer is added to the line with a higher priority than the front customer, the new customer should not be put in front of the customer being serviced - only those that are also waiting in line. The store simulation with regards to the service time of customers, probability that new customers show up, and program output will be the same as it was for the first program The program (driver) should simulate 60 minutes of activity at the store. Each iteration of your program should represent one minute. At each iteration (minute), your program should do the following Check to see if new customers are added to the queue. There is a 25% chance that new customers show up (need to be added to the queue) every minute. This does not mean you should add iterations, but rather each iteration should have its own 25% chance Update the customer object currently being serviced (if one exists). This will be the customer object at the front of the queue. If the customer has been completely serviced, remove them from the queue During execution, your program should output the following information When a new customer is added to the queue, output, "New customer added! Queue length is now X" where X is the size of the queue after the new customer has been added When a customer has been completely serviced, output, "Customer serviced and removed from the queue Quest length is now X" where X is the size of the queue after the customer has been removed to visually identify the At the end of each iteration (minute), output," passing of time When your simulation ends, your program should also output the following information . Total number of customers serviced Maximum line length during the simulation