you need to provide a brief explanation of your codes and the efficiency analysis with comments.

1. The airline companies organize their flights from an airport they serve to all possible destinations by considering the fact that the planes may take an emergency landing. So, the flights can only be arranged along predetermined routes between airports. Besides, the airlines companies have to ensure that all the airports in a planned flight will be no more than four links away from the airport that the company serves. Note that a planned flight can consist of multiple stops, and link here refers to the flight from one stop to the next one. Assume you are given a graph with the set of vertices (denoted by V) representing the airports, the set of edges (denoted by E) representing the flights between the airports, and the set of weights (denoted by W) representing the distance between the pair of adjacent airports. For a specific airline company, let A be the set of airports that the company serves. Your task is to develop an algorithm that calculates the shortest paths from a specific airport s to all other airports with restriction that the airports in a path cannot be more than four edges away from an airport in A.

A B C D E \#airports name 01006 \#flights between airports 10200 020033 60310 A E \#find the sequance of flights from A to E D A \#find the sequance of flights from D to A output for AEABCE output for DADCBA PS 1: There can be various numbers of airports. In this example, it's 5(A B C D E). PS 2: It can be tested with a various number of inputs. This means it will not be tested with just 2 inputs (in this example, they are A E, D A.) input1 - Not Defteri Dosya Dzenle A01006ADB10200EAC02033D00301E60310 output1 - Not Defteri Dosya Dzenle ADBCCBEA