Explain step by step(legible hand witten)

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

11100000 00000000 00000000 00000000 through 11100000 00111111 11111111 11111111 0

11100000 01000000 00000000 00000000 through 11100000 01000000 11111111 11111111 1

11100000 01000001 00000000 00000000 through 11100001 01111111 11111111 11111111 2

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 inter-face for datagrams with destination addresses:

11001000 10010001 01010001 01010101

11100001 01000000 11000011 00111100

11100001 10000000 00010001 01110111