2. (20 pts) Consider the graph below. 8 2 a) Find the minimum spanning tree of the graph using the Kruskal's algorithm. Show each step! Kruskal algoritmasn kullanarak en kk spanning aac bulunuz. Tm admlar gsteriniz. 11 3 1 2 3 3 8 b) Find the shortest paths from vertex 1 to each other vertex using Dijsktra's algorithm. Show each step! Dijsktra algoritmas ile dm 1'den dier tm dmlere en ksa yollar bulunuz