= Let G=(V, E) be a connected undirected graph, and for every edge e E, let c(e) be its cost. Edge costs do not need to be positive. We say that H (U, F) is a subgraph of G if U CV, FCUXU, and FC E. We say that a subgraph H is a spanning subgraph of G if it is connected and U = V. A minimum spanning subgraph (MSS) is a spanning subgraph of minimum cost, where the cost of a subgraph is defined as the sum of the costs of its edges. (a) [15 marks] Draw the graph G represented by the following adjacency lists data structure: Vertex v List of neighbours N[v] 1 2,3,5 2 1,3,4,5 3 1,2,4 4 2,3,5 5 1,2,4 and the following edge costs list: Edge e{1,2} Cost c(e) (1,2) {1,3} {1,5} {2,3} {2,4} {2,5} {3,4} {4,5) }|(4,5) 3 2 -2 -3 4