Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is as shown.
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 neighbouring routers denoted as \(X\), \(Y\), and \(Z\). During one iteration, \(R\) measures its distance to its neighbours \(X, Y, Z\) as \(3, 2,\) and \(5\), respectively. Router \(R\) gets routing vectors from its neighbours that indicate: - Distance to router \(P\) from \(X, Y, Z\) are \(7, 6,\) and \(5\), respectively. - Distance to router \(Q\) from \(X, Y, 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 update during this iteration? 
