Question 2/4 Study the following graph. Below is the completed solution to find the shortest path from X to Susing dijkistra's algorithm. the solution values have been replaced with alphabet symbols. You are required to provide the correct value for each of the put each symbol and its value on a separate line in your solution. (14 Marks) z 14 2 4 6 9 3 2 1 1 4 u CW 3 Step N' D(2) D(s),p(s) D(t).p(t) D(u),plu) D(V),p(v) D(w),p(w) Dly),ply) 1,x 6.x h g 0 i 2,w 6.x 1 a SZ 2 14 4 co 9 2 4 3 Step D(s),p(s) D(t),p(t) 0 1 a * 0 0 0 0 0 SS. D(u),p(u) D(v),p(v) D(w),p/w) Dly),ply) h 1,X 6.X i 2,w 6.x 3.v j 3.v 2 11,v 3 k 7,u 7.u 4 5,u 5 m WD 3 Step N' D(s),p(s) D(1),p(t) 0 x 0 1 a 8 8 8 D(u),plu) D(V),p(v) D(w),p(w) Dly),ply) h 1,x 6,x i 2,w 6,x 3,v j 3,v 2 b 11,v 3 3 k 8 E 7,u 7.u 5,u m 7 6 f n Zoom image