Consider the birth-and-death process with all n = 2 (n = 0, 1, . . .), 1

Consider the birth-and-death process with all λn = 2 (n = 0, 1, . . .), μ1 = 2, and μn = 4 for n = 2, 3, . . . .
(a) Display the rate diagram.
(b) Calculate P0 and P1. Then give a general expression for Pn in terms of P0 for n = 2, 3, . . ..
(c) Consider a queueing system with two servers that fits this process. What is the mean arrival rate for this queueing system? What is the mean service rate for each server when it is busy serving customers?