Consider a datagram network using 8-bit host addresses. Suppose arouter uses longest
Chapter 4, Problem P12(choose chapter or problem)
Consider a datagram network using 8-bit host addresses. Suppose arouter uses longest prefix matching and has the following forwardingtable: Prefix Match Interface1 010 1111 2otherwise 3 For each of the four interfaces, give the associated range of destination hostaddresses and the number of addresses in the range.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer