Draw the directed graph corresponding to this adjacency list representation: {"ORD": ["JFK", "LAX", "SFO"], "CID": ["DEN", "ORD"], "DEN": ["CID", "SFO"], "JFK": ["LAX"], "LAX": ["ORD"], "SFO": []} Each of the vertex names represents an airport (e.g. ORD is Chicago-O'Hare). And each edge represents an available direct flight from one airport to another. Complete function printAllDirect-Flights(flightGraph) that takes as input a dictionary like in part a and prints lines of the form "There is a direct flight from... to..." (where the...'s are replaced airports), one for each direct flight represented by the graph. def prlntAllDirectFlights(flightGraph)