Given is undirected graph G with nodes: [0, 1, 2, 3, 4, 5, 6, 7, 8] and list of edges with weights, (where [vertex1, vertex2, w] means an edge connecting vertex1 and vertex2 that has weight w, e.g. [0, 1, 5] means edge connecting vertices 0 and 1 with the weight of 5: [[0, 3, 14], [0, 6, 3], [1, 7, 10], [2, 5, 10], [2, 3, 8], [2, 8, 5], [4, 6, 12], [5, 6, 10], [7, 8, 4]] Apply Dijkstra algorithm on graph G, starting from vertex 0. Mark all true statements

Distances from vertex 0 to each vertex are: {0: 0, 1: 41, 2: 22, 3: 14, 4: 15, 5: 13, 6: 3, 7: 31, 8: 27} where we denote a vertex and its distance to vertex 0 as 'vertex: distance' Parent vertices of each vertex are: {0: 0, 1: 41, 2: 22, 3: 14, 4: 15, 5: 13, 6: 3, 7: 8, 8: 27} where we denote a vertex and its parent as 'vertex: parent' Shortest path from vertex 0 to vertex 3 is 3-0