Exercise 3 (15 points) 1. To find a minimal spanning tree using Kruskal or Prim algorithm in the following graph: V = {A, B, C, D, E, F) and weights: W(A,B) = 3, w(A,F) = 4, w(B,C) = 5, w(B,F) = 8, w(C,F) = d, W(B, E) = 4, w(E,C) = 10, w(E, D) = 9, W(D, C) = 5, W(FE) = d. w(E, D) = d3, where dj, dz, dz are the first three non-null digits in your student id. Please specify the steps of the algorithm. Note: if the student id hasn't got three non-null digits, please use as many non-null digits as possible (1 or 2) and fill the other edges with a null weight. 2. Let's consider A as the root of the tree, please traverse the obtained tree using pre-order and post-order algorithms. Exercise 4 (25 points) Apply Dijkstra for finding the minimal path between the nodes A and Lin a graph with nodes V = {A, B, C, D,E,F,G,H,1,J, K, L} and weights: w(A,B) = 3, W(A,C) = 2, w(A, E) = 9, w(BD) = 2, w(H, L) = d3, w(BE) = 4, w(CE) = 6, w(C,F) = 9, w(D,G) = 3, w(KL) = 3, w(E,G) = 1, w(E,H) = di w(FH) = 1, W(F. 1) = 2, w(, L) = 5 w(G, D = d2, w(HD) = 5, w(I,K) = 2, W(H,K) = 6, where d, d, d, are the first three non-null digits in your student id. Please specify the steps of the algorithm