Longest prefix matching Consider a datagram network using 32-bit host addresses

a) Suppose that a router has three interfaces, numbered 0, 1, 2, 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) Destination address range Outgoing link interface throu 01011101 00000000 00000000 00000000 throu 01110110 00000000 00000000 00000000 through b) Repeat (a) when packets are to be forwarded to the link interfaces as follows. (10 points) Destination address range Outgoing link interface through 00000001 10000000 00000000 00000000 01010101 00000000 00000000 00000000 through 01010110 00000000 00000000 00000000 through 2