Write a design for a complete solution to the problemSuppose you are given a timetable, which consists of the following: A set A of n airports, and for each airport a ? A, a minimum connecting time c(a) A set F of m flights, and the following, for each flight f ? F:? Origin airport a1(f) ? A? Destination airport a2(f) ? A ? Departure time t1(f)? Arrival time t2(f).Describe an efficient algorithm for the flight scheduling problem. In this problem, we are given airports a and b, and a time t, and we wish to compute a sequence of flights that allows one to arrive at the earliest possible time in b when departing from a at or after time t. Minimum connecting times at intermediate airports should be observed. What is the running time of your algorithm as a function of n and m?Describe all classes that must be defined.Describe the data stored in each class, including both the explicit data type and the purpose of each class and instance variable.Give complete, detailed pseudocode for the algorithm required in the problem.Give complete, detailed worst-case time efficiency analysis of your algorithm pseudocode.Computer ScienceEngineering & TechnologyPython Programming ITCS 6114
