Consider a computer network using the distance-vector routing algorithm in its network layer. The partial topology of the network is as shown below.

The objective is to find the shortest-cost path from the router R to routers P and Q. Assume that R does not initially know the shortest routes to P and Q. Assume that R has three neighboring routers denoted as X, Y, and Z. During one iteration, R measures its distance to its neighbors X, Y, and Z as 4, 4, and 5, respectively. Router R gets routing vectors from its neighbors that indicate that the distance to router P from routers X, Y, and Z are 3, 2, and 4, respectively. The routing vector also indicates that the distance to router Q from routers X, Y, and Z are 1, 2, and 3, respectively. Which of the following statement(s) is/are correct with respect to the new routing table of R, after updating during this iteration?