All words in bold are meant to be classes: Route, Train, Station, Passenger. Write a program to simulate a Train route. A train route consists of an array of Stations, starting and ending with a terminal station. The time that a Train needs to travel between a pair of two consecutive stations on the route is given. Each station has a Queue of Passengers (use the Queue class that you developed in Problem 1) You may assume that every 10 minutes (or any other appropriate interval) a random number of Passengers (different for different station) arrive at each station and join the queue. Trains leave a terminal at regular intervals and stop at all the stations on the route. When a train stops at a station, all passengers for that station are removed from the train and then all the passengers waiting in the queue at the station board the train until either the queue is empty, or the train is full. After a train reaches the last station, it goes back on the route, so the passengers enter the train only if their destination is past their origination station.

The idea that, for each pair of devices v and w, there’s a strict dichotomy between being “in range” or “out of range” is a simplified abstraction. more accurately, there’s a power decay function f (·) that specifies, for a pair of devices at distance δ, the signal strength f(δ) that they’ll be able to achieve on their wireless connection. (we’ll assume that f (δ) decreases with increasing δ.) we might want to build this into our notion of back-up sets as follows: among the k devices in the back-up set of v, there should be at least one that can be reached with very high signal strength, at least one other that can be reached with moderately high signal strength, and so forth. more concretely, we have values p1 ≥ p2 ≥ . . ≥ pk, so that if the back-up set for v consists of devices at distances d1≤d2≤≤dk, thenweshouldhavef(dj)≥pj foreachj. give an algorithm that determines whether it is possible to choose a back-up set for each device subject to this more detailed condition, still requiring that no device should appear in the back-up set of more than b other devices. again, the algorithm should output the back-up sets themselves, provided they can be found.\