Consider the 6-node network shown below, with the given link costs.

The Dijkstra's algorithm is used to find the least cost path from source node U to all other destinations. What is the shortest distance to node Z and what node is its predecessor?

Answers below are in the format of (distance, node).

a) (10, y)

b) (1,x)

c) (1,y)

d) (10,x)