(4.00 Puanlar) 10- An undirected graph with a vertex set V = {0,1,2,3,4} and the distance matrix A = [[O 7 -- 2], [70591], [-501-). [-9 1 0 2], [21-20]] (5 rows, 5 columns) is given. What are the sequence of vertices included in the shortest path tree in his graph if Dijkstra's algorithm is run from vertex 2? a) 0-3-2-1-4 b) 0-1-2-3 0-4-1-3-2 7020 0-4-3-1-2 Bo brak