(5) A network employs the hop level flow control. The scheme used is the channel queue limit. sharing with minimum allocation. If the switch buffer is 50 packets and the number of output trunks is 5 (trunks I through 5), and buio (minimum buffer allocated for every output queue) is 5 packets. At a given instant of time, the number of packets waiting for transmission at the output queue is 2, 7.5, 3, 4 packets for output trunks 1, 2, 3, 4, 5 respectively. In additional 30 packets arrive for transmission over output trunk #2, how many of these packets are accepted in trunk 2 buffer, and how many are rejected? Repeat if the scheme of sharing with maximum allocation is used instead with buas = 15 packets. (5) A network employs the hop level flow control. The scheme used is the channel queue limit. sharing with minimum allocation. If the switch buffer is 50 packets and the number of output trunks is 5 (trunks I through 5), and buio (minimum buffer allocated for every output queue) is 5 packets. At a given instant of time, the number of packets waiting for transmission at the output queue is 2, 7.5, 3, 4 packets for output trunks 1, 2, 3, 4, 5 respectively. In additional 30 packets arrive for transmission over output trunk #2, how many of these packets are accepted in trunk 2 buffer, and how many are rejected? Repeat if the scheme of sharing with maximum allocation is used instead with buas = 15 packets