Write a program that reads in a list of fractions from the user, each separated by commas and the whole terminated by a semicolon, prints out the ones that are not in lowest terms. For example, a typical run might look like this:

    ~/$ ./hw
    2/4, 6/9, 3/11, 21/5, 8/10;
    2/4 is not in lowest terms!
    6/9 is not in lowest terms!
    8/10 is not in lowest terms!

In writing this program, define and use a function int gcd(int,int); that takes two positive integers and returns their greatest common divisor. (Check out Class 10 to remind yourself about computing gcd's.) Turn In this cover sheet, along with a printout of your program along with a screen capture showing your program running on the above input.