Here's a method to solve the problem. I am not sure how to use linearity, but this seems straightforward.
Suppose you have $b$ blue balls and $r$ other balls. The $$\mathbb P(1\text{st blue ball in the $n$th step})=\mathbb P(\text{other balls in the first $n-1$ steps})\mathbb P(\text{blue ball in the $n$th step})$$
Now \begin{align*}
P(\text{other balls in the first $n-1$ steps})&=\left(\frac{r}{b+r}\right)\left(\frac{r-1}{b+r-1}\right)\cdots\left(\frac{r-n+2}{b+r-n+2}\right)\\&=\frac{r!}{(r-n+1)!}\frac{(b+r-n+1)!}{(b+r)!}
\end{align*}
and
$$\mathbb P(\text{blue ball in the $n$th step})=\frac{b}{b+r-n+1}$$
Putting things together, we have
$$P(\text{blue ball in the $n$th step})=b\frac{r!}{(r-n+1)!}\frac{(b+r-n)!}{(b+r)!}=b\frac{^rP_{n-1}}{^{b+r}P_n}$$
Let the expectation be written in the notation $$\mathbb E(b,r):=\mathbb E[\text{step when $1$st blue ball}]$$
Then $$\mathbb E(b,r)=\sum_{n=1}^{r+1}nb\frac{^rP_{n-1}}{^{b+r}P_n}=b\sum_{i=1}^{r+1}\frac{\binom{r}{n-1}}{\binom{b+r}{n}}=b\frac{b+r+1}{b(b+1)}=\frac{b+r+1}{b+1}=1+\frac{r}{b+1}$$
where I shamelessly plugged in the value Wolfram tells me for the sum (I will try and see how to derive the sum).
For your case, this reduces to $\mathbb E(10,9)=1+\frac{9}{11}=\frac{20}{11}$.
Sorry I couldn't edit the answer quicker, I had to run to attend a talk. The answer was extremely suggestive, and was at the back of my mind the whole talk. The $1$ clearly comes from the step of taking out the blue ball. Then what of the term $\frac{r}{b+1}$? It can be written in the form $$\frac{r}{b+1}=\sum_{i=1}^r\frac{1}{b+1}$$ so the burning question was, is there a random variable whose expectation is $\frac{1}{b+1}$? But that looked like a probability, so I was thinking maybe some indicator random variable could work since probabilities and expectations are the same for them. Then, we need to find a indicator random variable $I_j$ such that $\mathbb P(I_j=1)=\frac{1}{b+1}$ and $1\le j\le r$. Once you notice that $b+1$ is the number of blue balls and a red ball, things fall into place instantly.
Enough for motivations, let's get our hands dirty. Tag all the red balls with numbers from $1$ to $r$. Let $$I_j=\begin{cases}1,\ \text{if the red ball numbered $j$ is drawn before any blue ball}\\0,\ \text{otherwise}\end{cases}$$
Then what is $\mathbb P(I_j=1)$? I claim it's just $\frac{1}{b+1}$. Why? Suppose you draw the red ball labelled $j$. It could have been drawn before the first blue ball, after the first blue ball, after the second blue ball etc. Out of this, only the first case is favourable, and there are a total of $b+1$ cases. Thus the reuslt. Then $$\mathbb E[I_j=1]=\frac{1}{b+1}$$
Let $X$ be the random variable that counts the number of steps when the first blue ball appeared. We require $\mathbb E[X]$. Note that $X-1=\sum_{j=1}^r I_j$ since the indicator variables are exactly $1$ when there has not been a blue ball yet and a red ball has been pulled, and we need excatly $X-1$ red balls. Hence $$\mathbb E[X]=\mathbb E\left[1+\sum_{j=1}^rI_j\right]=1+\sum_{j=1}^r\mathbb E[I_j]=1+\frac{r}{b+1}$$
and we are done.