Consider Dijkstra's algorithm in the link 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 a minimum-cost routes,but does not 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.Assume that all link costs are non-negative.Which of the following statements is false of u's routing table?
A)There are topologies and link costs where the majority of the routes to other nodes will be incorrect.
B)There are topologies and link costs where no routing table entry (other than from u to itself) will be correct.
C)There are topologies and link costs where all routing table entry (other than from u to itself) will be correct.
D)Both (A) and (B)