Write a C++ program for Euclids Algorithm that keepstrack of the number of iterations (% & loop)
1. Euclid’s Algorithm An alternative of the Euclidean algorithmfor finding greatest common divisors (GCD) is repeatedly performingthe modulo operation on two numbers until the remainder is 0. Hereis the pseudocode for find the GCD of two positive numbers a and busing the Euclidean algorithm :while b ≠0 temp = b b = a mod t a =t Create a program that asks the user for two positive integers.The program should validate that the input numbers are bothpositive and asks the user to reenter if needed. It then calculatesthe GCD using the Euclidean algorithm as described above, whilekeeping track of how many times the modulo operation is performed.The program outputs should include the GCD and the number of timesfor which the modulo operation is performed.
