Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows:

Link Interface and Desination Address Range:

Link Interface 0, and address range: 11100000 00000000 00000000 00000000 through 11100000 11111111 11111111 11111111

Link Interface 1, and address range: 11100001 00000000 00000000 00000000 through 11100001 00000000 11111111 11111111

Link Interface 2, and address range: 11100001 00000001 00000000 00000000 through 11100001 11111111 11111111 11111111

Otherwise use Link Interface 3

Compute a forwarding table that has four entries, uses longest-prefix matching, and forwards packets to the correct link interface. So the answer shoud have "Row 1: the bit pattern, and the link interface, Row 2: the bit pattern, and the link interface, etc." all the way to and including Row 4 (the rows being each link interface and its address range).