CODING in R STUDIO Suppose you repeatedly draw upper-case letters from a jar without replacement until the first time you get one that is out of order. What is the expected number of draws for this to occur? (Example: if you draw B-E-R-D, you would stop at D, because it was the first letter you drew that didn't occur after the previous letter in the alphabet.)

I dont need charts or tables. The answer is about 2.72 draws but I need the work to do it.