In a switch using the token bucket algorithm, tokens are added to the bucket at a rate of r = 5 tokens/second. The capacity of the token bucket is c = 10. The switch has a buffer that can hold only eight packets (for the sake of example). The packets arrive at the switch at the rate of R packets/second. Assume that the packets are all the same size and need the same amount of time for processing. If at time zero the bucket is empty, show the contents of the bucket and the queue in each of the following cases and interpret the result.

a. R = 5

b. R = 3

c. R = 7