4 W 6 . 7 u 3 5 Ez 2 7 -3 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, 8 8 2 uXV 5,u 10,x 3 ? ? ? ? ? ? 4 ? ? ? ? ? ? In the given scenario, Dijkstra's algorithm is used with the source node u. What are the updated distances in step 4? Use alphabetical order to break ties if nodes have the same distance value. D(w),p(w) D(x),p(x) D(y),p(y) D(z),p(z) A 5,u 10, B 6,w 13,w 6,W 11,w D 11,w