Consider the following statements, when a distance vector routing protocol finding minimum cost paths suffers from count to infinity problem:
S1 : The count-to-infinity problem may arise in distance vector routing protocol, when network gets disconnected.
S2 : The count to infinity problem may arise in a distance vector routing protocol even when the network never gets disconnected.
S3 : The “path vector” enhancement to a distance vector routing protocol always enables the protocol to converge without count to infinity.
Which of the following is correct?
(A) Only S1 AND S3
(B) Only S2 AND S3
(C) Only S2
(D) All of them