$4.$ 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:

$($i$)$ Provide a forwarding table that has five entries, uses longest prefix match$-$ ing, and forwards packets to the correct link interfaces.

$($ii$)$ Describe how your forwarding table determines the appropriate link inter$-$ face for datagrams with destination addresses:

$($iii$)$ Rewrite this forwarding table in $($a$)$ using the a$.$b$.$c$.$d$/$x notation instead of the binary string notation.