Homework 2 1. Suppose a sender sends a 4,500 byte datagram into a link that has an MTU of 500 bytes. Suppose the original datagram is stamped with the identification number 402. how many fragments are generated? For each fragment, list the fields length, ID, flag and offset. 2. (link state routing) For the network given below, show how the link-state algorithm builds the routing table for node w (note: you need to give the detailed steps) 4 3 3. Consider the network shown below. Give global distance-vector tables of cach node when the nodes receive update information from their neighbors. Assume that a) each node initially knows its cost to its neighbors b) each node has reported the information it had in the preceding step to its immediate neighbors Homework 2 1. Suppose a sender sends a 4,500 byte datagram into a link that has an MTU of 500 bytes. Suppose the original datagram is stamped with the identification number 402. how many fragments are generated? For each fragment, list the fields length, ID, flag and offset. 2. (link state routing) For the network given below, show how the link-state algorithm builds the routing table for node w (note: you need to give the detailed steps) 4 3 3. Consider the network shown below. Give global distance-vector tables of cach node when the nodes receive update information from their neighbors. Assume that a) each node initially knows its cost to its neighbors b) each node has reported the information it had in the preceding step to its immediate neighbors