Code in C++ PLEASE

Project description: Euclid's algorithm is based on applying repeatedly the equality gcd(m,n)=gcd(n,mmodn), where mmodn is the remainder of the division of m by n, until m mod n is equal to 0 . Write a program to implement Euclid's algorithm to find the following: 1. Maximum number of divisions (mod operation) made by Euclid's algorithm among all inputs 1m,n512 (50 points) 2. Average number of divisions (mod operation) made by Euclid's algorithm among all inputs 1m,n512 (50 points) * Submit your program as file upload. The output of your program should display the answers to the two questions above