Question 3 1 pts 5 4 W 6 7 3 5 1 z 2 7 Ex 8. Step N' D(v),p(v) D(w),p(w) D(x),p(x) D(y),p(y) D(z),p(z) 7,u 5,u 2,u 0 u 1 ux 5,x 5,u 10,X 2 Uxv 5,u 10, 3 ? ? ? ? ? ? 4 ? ? ? ? ? ? In the given scenario, Dijkstra's algorithm is used with the source node u. Which edges are in the shortest path tree (i.e., the minimum spanning tree) once Dijkstra's algorithm is complete? Use alphabetical order to break ties if nodes have the same distance value. EX EZ M M EZ - X EZ M M EX EZ M M