1. The Greatest Common Divisor (GCD) The greatest common divisor (GCD) of two integers is the largest integer that evenly divides each of the numbers. Write a program that implements the gcd function. The program reads pairs of integers from hw02_pl.dat, for each pair of integers the program calls the gcd function that returns the greatest common divisor of the two integers. The actual number of pairs of integers in the data file is unknown. Let's assume all input integers are positive integers. Prototype for the gcd function int ged (int first, int second): Sample output: % cat hw02_p1.dat 99 33 2 13 1 24 % hw02pl The GCD for 99 and 33 is 33 The GCD for 100 and 88 is 4 The GCD for 2 and 13 is 1 The GCD for 1 and 24 is 1