Q4: (10 marks) A: Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table: Interface Prefix Match 00 0 010 1 011 2 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. (15 marks) B: Consider the network shown below and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at node z. 3-3 6 2. 3