C++

Pointers and Arrays are NOT allowed.

Activity Provide your C++ source code and screenshot of your program output. 1. Euclid's Algorithm An alternative of the Euclidean algorithm for finding greatest common divisors (GCD) is repeatedly performing the modulo operation on two numbers until the remainder is 0. Here is the pseudocode for find the GCD of two positive numbers a and b using 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 both positive and asks the user to reenter if needed. It then calculates the GCD using the Euclidean algorithm as described above, while keeping track of how many times the modulo operation is performed. The program outputs should include the GCD and the number of times for which the modulo operation is performed