Queuing Theory problem (M/M queue)

[A-fil]

Homework Statement

Given an M/M type queuing model on an first come first save basis, where 2 kinds of customers (type 1 and type 2) arrive as poisson processes with arrival rate λ₁ and λ₂ respectively, being served by one cashier with timewise exponential distribution with parameter μ. However, if the amount of customers in the system (type 1 and type 2) are more than K people, then customers of type 1 can skip queing and leave the cashier. Type 2 will always queue no matter what.
(1) Give the balance equation expressed with the balance state probability for n customers in the system p_n.
(2) Solve the equation from (1). Find the conditions so that there exists an balance state.
(3) Find the average number of customers in the system.

Homework Equations

The Attempt at a Solution

(1)
I think I got this one right, I made a simple graph
Numbers below show states (how many people are in the queue) and the arrows with probabilies indicate change of states (not a beautiful illustration, but hopefully you understand).
1 >-λ₁+λ₂-> 2 >-λ₁+λ₂-> ... >-λ₁+λ₂-> n-1 >-λ₁+λ₂-> n >-λ₁+λ₂-> n+1 >-λ₁+λ₂-> ... >-λ₁+λ₂-> K >-λ₂-> ...
1 <-μ-< 2 <-μ-< ... <-μ-n<-μ-< ... <-μ-< K <-μ-< ...

This gives:
μ p₁ = (λ₁+λ₂) p₀

(μ + λ₁ + λ₂) p_n = (λ₁+λ₂) p_n-1 + μ p_n+1 for 0 < n < K

(μ + λ₂) p_K = (λ₁+λ₂) p_K-1 + μ p_K+1

(μ + λ₂) p_n = λ₂ p_n-1 + μ p_n+1 for n > K

And maybe also use

[itex]\sum_{n=0}^{\infty}p_{n} = 1[/itex]

(2) Solving this is where I got stuck, I was thinking about doing it with Z-transform but it didn't really work out. He seems to just see how it turns out in the other examples in the book, but I have a hard time to see how to solve this. As for the conditions for convergence, I'm a bit clueless.


(3) I think I'm supposed to do this with Little's Formula

 

[kurt.physics]

, but I'm unsure how. I've read the wikipedia page, and some other sources, but it's still quite blurry. It would be nice if someone could explain how to do this using Little's Formula.