Need help on trying to fix my code. I need to add a function so it counts how many Euclidean steps it takes. (Python coding)

def Euclidean_algorithm (a,b): dividend = a divisor-b count 0 while divisor 1-0: # Recall that I-means "is not equal to". quotient , remainder countcount+ 1 print ("{} = {} ({}) print (count) dividend-divisor divisor-remainder -dividend // divisor , a % b + {}".format (dividend, quotient, divisor, remainder )) Euclidean_algorithm (32,64) 15 32 1 (32) + 32 16 32-1 (32) 32 32-1 (32) 32 18 32-1 (32) 32 32-1 (32 ) + 32