Write a program that will use queues to simulate tollbooth station traffic. Cars arrive at the toll station at an average rate (probability). Each toll transaction will take a certain amount of time, according to a user-entered distribution. As each car arrives it is placed in the queue. If the queue is filled to capacity, a second queue is opened and the queues share the accumulated load. A newly arriving car will always go into the shortest queue, thereby acting as a natural balancing method. Whenever all open queues are filled to capacity, a new queue is opened, and the entire load is redistributed. Once a queue is open it is never closed. The object then is to find a minimum “correct” number of queues that will maintain servicing incoming traffic without overloading any of the queues. Since probability is a factor, we will assume that “one hour” of operation without any queue overload satisfies our objective.