Question: Constrcut the adjacency matrix and the adjacency lists for the graph G below, where the weights associated with edges represent distances between nodes. If no edge is present, it is equivalent to having a distance equal infinti.