Show the adjacency list (general) and adjacency matrix representation for the following graph, respectively. ORD PVD MIA DFW SFO LAX LGA HNL 894 802 1378 1734 1834 1099 1102 1233 437 5255 124

Would you use the adjacency matrix structure or the adjacency list structure in each of the following cases? Justify your choice.

The graph has 2,000 vertices and 10,000 edges, and You need to answer the query getEdge(u, v) as fast as possible, no matter how much space you use.

The graph has 20,000 vertices and 10,000,000 edges, and it is important to use as little space as possible.

Consider the same graph shown in Q1 (If multiple choices are possible, please chose the city in alphabetic order).

Give the sequence of vertices of G visited using a DFS traversal starting at vertex ORD.

Give the sequence of vertices visited using a BFS traversal starting at vertex PVD.

Show the minimum spanning tree (A graph consists of all the nodes and edges selected by the minimum spanning tree algorithm)