Let A and B be two Monte Carlo algo- rithms for solving the same decision problem. Algorithm A is true-biased and p-correct. Algorithm B is false-biaised and q-correct. Show how to combine A and B into a Las Vegas algorithm LV (x, y, success) to solve the same problem. One call of LV should not take significantly more time than a call on A followed by a call on B. If your Las Vegas algorithm succeeds with probability at least r whatever the instance x, what is the best value of r you can obtain.

https://www.chegg.com/homework-help/questions-and-answers/10-points-brassard-bratley-1028-let-b-two-monte-carlo-algo-rithms-solving-decision-problem-q46837077