----------------------------------------------------

Prefix Match Interface

----------------------------------------------------

00 0

01 1

10 2

11 3

----------------------------------------------------

For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range.

2. Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm to compute the shortest path from x to all network nodes. Show how the algorithm works by computing a table similar to the one shown below.

3. Consider the network shown in Problem 2. Using Dijkstra's algorithm, and showing your work using a table similar to the one shown in Problem 2, do the following:

a) Compute the shortest path from y to all network nodes.

b) Compute the shortest path from t to all network nodes

### Recently Asked Questions

- Which factor is NOT on Sameroff's environmental risk scale? African American family rigidity of parents' beliefs about child development stepfather in home

- A golfer wishes to find a ball that would travel more than 170 yards when hit with his 6-iron a club heads speed of 90 miles per hour.he had a golf equipment

- Differences in IQ scores of children in different racial and ethnic groups: do not tell us anything about what would happen if the children lived in different