Consider the following Python program to compute the GCD of two integers a and b (assuming that a > b > 0). Is the algorithm correct? Is the algorithm efficient? Justify your response.

for i in range(b,0,-1): if a % i ==0 and b% i ==0: printi break