I have an M/M/1 queue with people arriving Poisson with parameter $\lambda$ and a service time exponentially distributed rate $\mu$.
I have been asked to find the average time between the first person arriving at the queue and the queue being empty again.
I let the Expected time for the queue to be empty from there being n people be denoted $E_n$
Thus:
$$ (\lambda + \mu)E_n = 1 + \lambda E_{n+1} + \mu E_{n-1} $$
Solving this gave me
$$ E_n = \frac{n}{\mu-\lambda} + c_1 + c_2 \left(\frac{\mu}{\lambda}\right)^n $$
And substituting $E_0=0$ in told me $c_1=-c_2$.
But this still leaves me with:
$$ E_n = \frac{c_2\left(\left(\frac{\mu}{\lambda}\right)^n -1\right)(\lambda - \mu) - n }{\lambda - \mu} $$
How should I work out what $c_2$ is?