solve the problem with a code in C language . An integer with N elements will be taken to the array A by N different positive numbers from the user. It will be assumed that the numbers will be entered as positive and it will not be checked if the numbers are not entered. The greatest common divisor and the smallest common multiple of all these integers will be calculated and written on the screen.

Example: For N = 4, the values received from the user should be stored in the A array as A = [10, 50, 15, 30]. As a result The following output should be written on the screen.

Least common multiple(10, 50, 15, 30) = 5 , greatest common divisor(10, 50, 15,30) = 150