Flight scheduling: you are devising a flight scheduler for a travel agency. The scheduler will get a list of available flights, and the customer's origin and destination $($Where they are and where they want to go$).$ For each flight, it is given the cities and times of departure and arrival. The scheduler should output a list of flights that will take the customer from her origin to her destination that arrives as early as possible, subject to giving her at least $15$ minutes for each connection. The task is to find the quickest route for a customer from their origin city to their destination city, considering available flights and connection times.

Create a graph where cities are nodes.

Add directed edges between cities based on available flights, with edge weights representing flight times and durations.

Draw an example of what the graph might look like and give as efficient as possible an algorithm to solve the problem in psuedocode. Explain your reasoning.