Consider the above topology figure, with each link cost (as standard for RIP) is 1. Assume that initially the routing is converged (everything is calculated correctly) and no link is failed. 1.1. Routing table Show routing table and routing cost to each destination from node d Destination node Next hop node a b e f B Routing Cost 1.2. Overhead Consider this network be up for 2 hours, but no other traffic except RIP protocol exchanges have been happening during these 2 hours and no links failed. Estimate the number of packets that were sent in the network during this time (i.e., the sum of packets sent over each link). You need to consider how often each individual node sends RIP updates and how far such individual update propagates (how many links it traverses). Briefly explain or mark your calculation, so it is clear how you come up with the number (no credit if you show just a number). 1.3. Differences link state vs distance vector Highlight at least two major differences between distance vector (like in RIP) and link state (like in OSPF) algorithms