Solve the following problem:
Compute the acceptance probability ρ(x, y) in the case q(y|x) = g(y). Deduce that, for a given value x(t), the Metropolis-Hastings algorithm associated with the same pair (f,g) as an Accept-Reject algorithm accepts the proposed value Yt more often than the Accept-Reject algorithm.
Make sure you use enough details to support your answer.