$(3$pts$)$ Consider the switch shown below. Suppose that all datagrams have the same fixed length, that the switch operates in a slotted, synchronous manner, and that in one time slot a datagram can be transferred from an input port to an output port. The switch fabric is a crossbar so that at most one datagram can be transferred to a given output port in a time slot, but different output ports can receive datagrams from different input ports in a single time slot. What is the minimal number of time slots needed to transfer the packets shown from input ports to their output ports, assuming any input queue scheduling order you want?

What is the largest number of slots needed, assuming the worst$-$case scheduling order you can devise, assuming that a non$-$empty input queue is never idle?

$(2$pts$)$ Consider a datagram network using $8-$bit host addresses. Suppose a router uses the longest prefix matching and has the following forwarding table:

For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range.

$\backslash$table$[[$Prefix Match,Interface$],[00,0],[01,1],[100,2],[$otherwise$,3]]$