N different positive numbers to an integer A array with N elements will be received from the user. Numbers will be entered positive will be assumed and not entering positive will not be checked. The greatest common of all of these integers divisor and smallest common multiple will be calculated and written on the screen. Example: For N = 4, the values received from the user are stored in the A array as A = [10, 50, 15, 30). As a result The following output should be written on the screen. GCD (10, 50, 15, 30) = 5, LCM (10, 50, 15,30) = 150 solve it with pseudo code, flowchart and the program you will write in C programming language. Do the variable analysis of the program. I need it done with dev c ++