Using NetBeans Java

General Instructions: Write a program that will use queues to simulate a Theme Park Waiting Line for n number of rides. Guests wil arrive at the Theme Park at an average rate (probability). Each ride will take a certain amount of time, according to a random distribution. As each guest arrives, they will decide which ride to go on (including fast pass access). A newly arriving guess will randomly pick a ride to go on. The object then is to find a most popular ride before the Theme Park closes. Since probability is a factor, we will assume that "one hour" of operation to analyze our objective Specific Instructions: The theme park will have of total 10 rides. The dynamic implementation of the queue ADT is recommended. In fact, the lines at each ride themselves are ADT. Calculate the lines at each ride to find statistics such as -arrival rate, duration of service, etc. The program will have a global "clock" which will be initialized to zero and increment by one for each simulated minute. For each minute, there will be a user-entered probability of an arrival. That is, there is a probability, say 0.20 (between 0 and 1.0) of a guest arrives at the theme park. So for each clock "tick", a random number will be generated. See below for details on arrivals and times of each ride Riders arrival: 50% no arrival 40% 1 arrival 10% 2 arrivals Time on Rides: 1 minutes to 5 minutes