Here's one solution. None of the AI engines I tried solved it.

The probability a given green is selected before all reds is 1/(n+1), so the expected number of greens drawn before all reds is n/(n+1). Reds before greens is the same, and it follows the answer is 2n/(n+1).