Consider the situation involving the creation of a routing loop in the network of Figure 3.30 when the A–E link goes down. List all sequences of table updates among A, B, and C, pertaining to destination E, that lead to the loop. Assume that table updates are done one at a time, that the split-horizon technique is observed by all participants, and that A sends its initial report of E’s unreachability to B before C. You may ignore updates that do not result in changes.

 Figure 3.30)

F B E a