Suppose we have a las vegas algorithm C to prove ZPP is contained in RP and co-RP. Run C for double its expected running time.By Markov s inequality, the chance that it will answer before we stop is:

Suppose we have a las vegas algorithm C to prove ZPP is contained in R

1.	Suppose we have a las vegas algorithm C to prove ZPP is contained in RP and co-RP. Run C for double its expected running time. By Markov s inequality, the chance that it will answer before we stop is:
A.	1/2
B.	1/4
C.	1/3
D.	none of the mentioned
Answer» B. 1/4