I need the proof of the acceptance probability of Metropolis-Hasting algorithm with step by step answer please.

2. For a Metropolis-Hastings algorithm compute the acceptance probability a(3:, 56*) for the proposal density: q(33*|:c) = Mai\"). For a given current value of the chain, :13\"), compare the acceptance probability of the Metropolis-Hasting algorithm with the acceptance probability of the Rejection algorithm for the same target and pro posal distributions, say f () and h(-), respectively (choosing the minimum possible value for M). Which of the two algorithms has a greater acceptance probability