C++

Write a clear code attach to it here pleae

A sample run

6. Euclid's method for finding the greatest common divisor (GCD) of two positive integers is given by the following algorithm: a) Divide the larger number by the smaller and retain the remainder. b) Divide the smaller number by the remainder, again retaining the remainder. c) Continue dividing the prior remainder by the current remainder until the remainder is zero, at which point the last nonzero remainder is the greatest common divisor. For example, find the GCD of 72 and 114: 114/72=1 with remainder 42 72/42=1 with remainder 30 42/30=1 with remainder 12 30/12=2 with remainder 6 12/6=2 with remainder 0 Enter first fraction: 2/4 Enter operation: - Enter second fraction: 5/6 Difference =1/3 Continue ( y or n) ? y Enter first fraction: 2/4 Enter operation: + Enter second fraction: 5/6 Sum =4/3 Continue (y or n)?n