Given an undirected graph with V nodes and E edges, create and return an adjacency list of the graph. 0-based indexing is followed everywhere. Node 0 is connected to 1 and 4. Node 1 is connected to ...