Pts$)$ a$.$ The bandwidth required in the link$-$state routing protocol is more than distance$-$vector protocol and the link$-$state requires a global view of the network. b$.$ Link state converges slower than distance$-$vector algorithm because of the larger table size of the link$-$state algorithm. c$.$ Open Shortest Path First $($OSPF$)$ is the best example of distance$-$vector algorithm and is widely used in current networks. d$.$ Since link$-$state routing algorithms converge slower, they are susceptible to more loops in the network.