Consider the following forwarding table below.

Indicate the output to link interface to which a datagram with the destination addresses below will be forwarded under longest prefix matching.

$($Note: The list of addresses is ordered below. If two addresses map to the same output link interface, map the first of these two addresses to the first instance of that link interface.$)[$Note: You can find more examples of problems similar to this here.$]$

$\backslash$table$[[$Destination Address Range,,Link interface,$],[11001000,00010111,00010*********,************************,0],[11001000,00010111,00011000,************************,1],[11001000,00010111,00011*********,************************,2],[$otherwise$,,,3,]]$