please write in C language:

Programming Projects . Write a program that finds the largest in a series of numbers entered by the user. The o nega gram must prompt the user to enter numbers one by one. When the user enters 0 or a nea tive number, the program must display the largest nonnegative number entered: Enter a number: 60 Enter a number: 38.3 Enter a number: 4.89 Enter a number: 100.62 Enter a number 75.2295 Enter a number: 0 The largest number entered was 100.62 Notice that the numbers aren't necessarily integers. 2. Write a program that asks the user to enter two integers, then calculates and displays their greatest common divisor (GCD): Enter two integers: 12 28 Greatest common divisor: 4 Hint: The classic algorithm for computing the GCD, known as Euclid's algorithm, goes as follows: Let m and n be variables containing the two numbers. If n is 0, then stop: m con- tains the GCD. Otherwise, compute the remainder when m is divided by n. Copy n into and copy the remainder into n. Then repeat the process, starting with testing whether n is 0