Write a program called gcd.c that contains a recursive function that calculates the greatest common divisor of two given integers. The tunction has the tollowing prototype int ged(int m, int n)i Hint: the classic algorithm for computing the GCD, known as Euclid's algorithm, goes as follows: Let m and n be the two numbers we want to get the gcd for. If n is 0, then stop since m is the gcd. Otherwise, compute the remainder when m is divided by n.Copy n into m and copy the remainder into n .Thern repeat the process, starting with testing whether n is 0. Remember that you must implement a recursive version of gcd. Your program prompts the user to enter two integers and then outputs the ged as follows: Enter two integers: 12 28 Greatest common divisor: 4 Files that need to be on GitHub: ged.c Makefile to compile the program