Problem 2 In a simple tcp based application, the client sends a tep packet (seq-20, ACK-6 data-e) to the server, and the server sends the following reply. Fill in the sequence number. (seqACK datac) Problem 3 The following tables are used in distanee vector routing algorihm (the cost may be asymmetrie Node I's routing table be fore update Desti- Cost Next nation Node 6 Node I has three neighbors N2, N3, and N4. After one moment, NI receives the following N2 tells NI that its cost to N6 has been changed to 7. N3 tells NI that its cost to N6 has been changed to 3. N4 tells NI that its cost to N6 has been changed to 9. Based on these results, N1 updaies its routing table. Afler running one round of the algorithm, in the new table, what will be the cost from NI to N6? Which node should be the next node in order to achieve the new cost