Exercise 2 (2 pts). Let A be a polynomial-time one-sided error Monte Carlo algorithm that decides a language L so that on every string x, if x L then A returns the answer yes with probability 0.1; if x / L then A returns the answer no with probability 1. Describe a polynomial-time randomized algorithm B that uses A (as a subroutine) to decide L with probability of error at most 0.1%.