Which of the following statements are true for different routing algorithms:

a$.$

In Distance vector algorithm, each node has information about every node in network

b$.$

Link state algorithms are more robust in dealing with incorrect path costs

c$.$

In link state algorithms, each node has information about only its directly connected neighbors

d$.$

None of Them

e$.$

Distance vector algorithms converge in O$($n$2)$ time.

f$.$

Link state algorithms can face route oscillation problems

g$.$

Distance vectors algorithms converge very slow if a new higher cost link between two nodes is advertised