1 What action does a link-state router take immediately upon receipt of an LSP from a neighboring router? • floods the LSP to neighbors calculates the SPF algorithm runs the Bellman-Ford algorithm computes the best path to the destination network 2 Why is it difficult for routing loops to occur in networks that use link-state routing? Each router builds a simple view of the network based on hop count. Routers flood the network with LSAs to discover routing loops. • Each router builds a complete and synchronized view of the network. Routers use hold-down timers to prevent routing loops. 3 Refer to the exhibit. What kind of information would be seen in an LSP sent from router JAX to router ATL? hop count uptime of the route • cost of the link a list of all the routing protocols in use 4 To achieve network convergence, what three steps does each link state router take? (Choose three.) use automatic summarization to reduce the size of routing tables • build a Link State Packet (LSP) contai