page 120 3.12 Show the sequence of changes to the routing tables in Figure 3.8 that will occur (according to the RIP algorithm given in Figure 3.9) after the link labelled 3 in Figure 3.7 is broken. pages 98-10 Figure 3.7 Routing in a wide area network or local 3 Links Figure 3.8 Routing tables for the network in Figure 3.7 Routings from A To Link Cost A loca 0 Routings from B To Link Cost Routings from C To Link Cost B local 0 C local0 Routings from D To Link Cost Routings from E To Link Cost D local 0 E local 0 page 120 3.12 Show the sequence of changes to the routing tables in Figure 3.8 that will occur (according to the RIP algorithm given in Figure 3.9) after the link labelled 3 in Figure 3.7 is broken. pages 98-10 Figure 3.7 Routing in a wide area network or local 3 Links Figure 3.8 Routing tables for the network in Figure 3.7 Routings from A To Link Cost A loca 0 Routings from B To Link Cost Routings from C To Link Cost B local 0 C local0 Routings from D To Link Cost Routings from E To Link Cost D local 0 E local 0