Suppose we have a small call center staffed by two operators A and B handling three telephone lines. A only handles line 1, and B only handles only line 2 and 3. Calls arrive according to a Poisson process with rate = 100 calls per hour. All arrivals prefer line 1. Arrivals find all lines are busy will go away. Service times are exponentially distributed with a mean of 4 minutes. Customers are willing to wait an exponentially distributed length of time with a mean of 8 minutes before reneging if service has not begun. Describe a continuous time Markov chain to model the system and give the rate transition diagram and the generator G.