Router w has neighboring routers x, y, z. Assume distance-vector routing is being used. The costs of the links from w to x, y, z are:

cost(w, x) = 3; cost(w, y) = 2; cost(w, z) = 4.

Now router w receives the following vectors of distances to routers p, q, r from x, y, z:

From x: [ D(x, p) = 3, D(x, q) = 1, D(x, r) = 5 ]

From y: [ D(y, p) = 2, D(y, q) = 3, D(y, r) = 4) ]

From z: [ D(z, p) = 5, D(z, q) = 2, D(z, r) = 1 ].

What should the updated routing entries at w for destinations p, q and r be?

	a.	Dest Next hop p z q y r x
	b.	Dest Next hop p x q z r y
	c.	Dest Next hop p y q x r z
	d.	Dest Next hop p y q z r x