P5) Consider the 6-router network shown below, with the given link costs: Step 0 1 2 3 4 5 9 N' 1 1 5 1 5 8 AB 1 2 2 a. Use Dijkstra's algorithm, find the least cost path from source router Y to all other destinations. Use the table below and show all steps of your work (add more rows if you need). (10 points) (20 Points) D(U),p(U) D(V),p(V) D(W), p(W) D(X), p(X) D(Z),p(Z)