5.06-2. Bellman Ford Algorithm (3, part 2). Consider the grid network shown below. All links have cost of 1. Let's focus on the distance vector (DV) in node L. [Note: You can find more examples of...

Suppose that the DV algorithm is operating synchronously (although this isn't a requirement).  Initially all nodes exchange their initial DV with their direct neighbors, and vice versa.  Following this exchange of initial DVs and re-computation of its local DV components, what are the DV entries in node L for destinations G, H, and I?  Enter these components of L's initial DV,below by matching a DV entry to its value in the pull-down menu.

Extracted text: 5.06-2. Bellman Ford Algorithm (3, part 2). Consider the grid network shown below. All links have cost of 1. Let's focus on the distance vector (DV) in node L. [Note: You can find more examples of problems similar to this here.] Suppose that the DV algorithm is operating synchronously (although this isn't a requirement). Initially all nodes exchange their initial DV with their direct neighbors, and vice versa. Following this exchange of initial DVs and re-computation of its local DV components, what are the DV entries in node L for destinations G, H, and I? Enter these components of L's initial DV,below by matching a DV entry to its value in the pull-down menu. DL(G) 1. infinity |DL(H) 2.3 3.1 DL(I) 4.5 5.2