Link$-$state routing. As discussed in class, the link$-$state routing algorithm does not have the looping

problems found with distance$-$vector routing. However, link$-$state routing does depend on all nodes

having an up$-$to$-$date database of link$-$state packets $($LSP$$s$).$ If there is inconsistent information at

different nodes then routing errors may occur. Consider a network that has nodes A$,$ B$,$ C$,$ D$,$ E$,$ F$,$

and G$.$ Each node generates a LSP that contains the following information:

$$ The ID of the node that created the LSP

$$ A list of directly connected neighbors of that node, with the cost of the link to each one

$$ Additional information such as sequence number and time to live

We will ignore the sequence number and time to live information and just focus on the ID and list of

neighbors. Assume that each node generates its own LSP as shown below and that each node has an up

to$-$date copy of all LSP$$s