USING C++ LANGUAGE ONLY. Please follow knowledge given and example output.

Purpose: to examine the properties of integers and the relationship between integers. This program looks at the Number Theory problems of prime numbers, the greatest common divisor, and the least common multiple. Details: For this program you will read in two numbers and determine the if either of the two are prime and then determine the greatest common divisor of the two numbers using Euclid's algorithm. Finally use Theorem 5 on page 282 of the text to find the least common multiple of the two integers. Write a C, C++ or Java program that accepts two positive integers and determines whether each of them is prime, then computes the greatest common divisor (gcd) and least common multiple (lcm). Sample output from one implementation: This program reads in two integers and determines if they are prime. It then computes the greatest common divisor of the two integers using Euclid's Algorithm. Enter the first integer: 414 Enter the second integer: 662 Results: 414 is not a prime number. 662 is not a prime number. The gcd(414,662) is 2 . The lcm(414,662) is 137034. When determining whether the integers are prime you should only check values up to the square root of the entered integer (e.g., for (i=2;ii