Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is as follows: router R has three neighbouring routers X, Y, and Z. X, Y, and Z each further connect down to additional (unspecified) routers, and eventually to routers Q (below X's subtree) and P (below Z's subtree). 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. During one iteration, R measures its distance to its neighbours X, Y, and Z as 3, 2, and 5, respectively. Router R gets routing vectors from its neighbours that indicate that the distance to router P from routers X, Y, and Z are 7, 6, and 5, respectively. The routing vector also indicates that the distance to router Q from routers X, Y, and Z are 4, 6, and 8, respectively. Which of the following statement(s) is/are correct with respect to the new routing table of R, after updation during this iteration?