***JAVA***

Air Ticket Planning

Input:

A list of airports, the ticket price and expected time of the flight

between a pair of airports, the source and destination airports, and

the maximum allowed total time spent on the flights. PLEASE USE THE GIVEN INFORMATION BELLOW FOR THE PROGRAM.

Output:

Find an itinerary between the source and destination whose

total time is within the threshold, while the total ticket price is minimum.

**Output must include a GRAPH and a list of flights with the cheapest and quickest flight.

Please use the following Topics/Algortihims: Graph, Bellman-Ford

PRICE Table P JFK BOS ORD MSP LAX 175 120 0 100 200 160 JFK BOS ORD MSP LAX 420 130 230 210 150 210 340 210 380 215330 90 260 230 0 210 int n = 5; /umber of nodes int[][] P = { 10, 160, 175, 210, 380} {130, 0, 120, 215, 330) 1230, 150, 0, 90, 260) 1210, 210, 100, 0, 230) 420, 340, 200, 210, 0} PRICE Table P JFK BOS ORD MSP LAX 175 120 0 100 200 160 JFK BOS ORD MSP LAX 420 130 230 210 150 210 340 210 380 215330 90 260 230 0 210 int n = 5; /umber of nodes int[][] P = { 10, 160, 175, 210, 380} {130, 0, 120, 215, 330) 1230, 150, 0, 90, 260) 1210, 210, 100, 0, 230) 420, 340, 200, 210, 0}