Suppose you are given a timetable, which consists of the following:

A setAof n airports, and for each airport a ?A, a minimum connecting time c(a)

A setF of m ?ights, and the following, for each ?ight f ?F :

? Origin airport a1(f)?A

? Destination airport a2(f)?A

? Departure time t1(f)

? Arrival time t2(f).

Define a weighted graph such that solving a shortest path problem on it(using Dijkstra or Bellman-Ford) will solve the flight scheduling problem. Describe clearly how to model the flight scheduling problem as a weighted directed graph, G so that a shortest path in G ( from vertex s to vetex d) gives a sequence of flights that allows one to leave a at a time t or later and arrive at b at the earliest possible time.