$1)$ Basic C$++$ programming language commands Write a C$++$ program that reads two Integers from the standard input and compute their GCD $($Greatest Common Divisor$).$ The GCD among two numbers is the greatest Integer that is the greatest common factor number that divides them, exactly. Any correct implementation is fine. One simple implementation is the Euclid recursive implementation that computes the GCD of two Integers a and b with a recursive function gcd$($a$,$ b$)$ that delivers a$,$ if b is equal to zero, or delivers the gcd$($b$,$ c$)$ where c is the remainder of the Integer division of a by b $($c $=$ a mod b$).$ For example: $$ the GCD between $12$ and $8$ is computed as: $$ gcd$(12,8)=$ gcd$(8,12$ mo