P$8.$ 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:

Destination Address Range Link Interface

$11100000000000000000000000000000$

through $0$

$11100000001111111111111111111111$

$11100000010000000000000000000000$

through $1$

$1110000001000000111111111111111$

$11100000010000010000000000000000$

through $2$

$11100001011111111111111111111111$

otherwise $3$

a$.$ Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces.

b$.$ Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses:

$11001000100100010101000101010101$

$11100001010000001100001100111100$

$11100001100000000001000101110111$