Consider a datagram network using $8-$bit addresses. A router with four links,

numbered $0$ through $3,$ is to forward packets to the link interfaces as follows.

$($a$)$ Provide a forwarding table with a minimum number of entries that uses longest prefix

matching and forwards packets to the correct link interfaces. Write the entries in ternary form,

that is$,$ using $0,1,**,$ where the $*$ is a wild card. $($Use as few rows as possible, though you may

have more than one row for the same link interface.$)$

$($b$)$ For address $10001001,$ list all prefixes that it matches and identify which of these

prefixes is longest.