Consider Dijkstra’s algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link connecting $u$ to $v.$ Ram then implements the rest of the algorithm correctly, aiming to produce minimum cost routes, but doesnot change the routes to the directly connected nodes. In this network, u has atleast two directly connected nodes and there is more than one path between any two nodes. Which of the following statement is false with u’s routing table?
$A)$ There are topologies and link costs where the majority of the routers to other nodes will be incorrect?
$B)$ There are topologies and link costs where no routing table entry (other than u to itself) will be correct.
$C)$ There are topologies and link costs where all routing table entry will be correct.
$D)$ Both $A)$ and $B)$
How Dijkstra working here?
