Question: Consider the variation of the leaky bucket scheme where W > 1 permits are allocated initially to a session and the count is restored back to W every W/r seconds. Develop a Markov chain model for the number of packets waiting to get a permit. Assume a Poisson arrival process.