5.06-1. Bellman Ford Algorithm (3, part 1). Consider the grid network shown below. All links have a cost of 1. Let's focus on the distance vector (DV) in node L. (AB) E (K) H M N R (W) X When the DV algorithm first begins, what are the initial values of the DV entries in node L for destinations G and H? Enter these components of L's initial DV,below by matching a DV entry to its value in the pull-down menu.

5.06-1. Bellman Ford Algorithm (3, part 1). Consider the grid network shown below. All links have a cost of 1. Let's focus on the distance vector (DV) in node L. (AB) E (K) H M N R (W) X When the DV algorithm first begins, what are the initial values of the DV entries in node L for destinations G and H? Enter these components of L's initial DV,below by matching a DV entry to its value in the pull-down menu.