$3)$ Longest prefix matching $-$ Consider a datagram network using $32-$bit host addresses.

a$)$ Suppose that a router has three interfaces, numbered $\backslash (0,1,2\backslash ),$ and that packets are to be forwarded to these link interfaces as follows. Any address not within the ranges in the table below should not be forwarded to an outgoing link interface. Create a forwarding table using longest prefix matching. $(6$ points$)$