Write a program that uses the recursive function to calculate GCD by using Euclid's algorithm. a) Request integer values for a and b from the console in main (). b) The recursive function accepts integers a and b as input parameters. c) The function returns the GCD of a and b using Euclid's algorithm. d) The function prints statement to display the process (see output). e) Trace the recursive process for this function. Euclid's GCD Algorithm: a) GCD (a, b) b) GCD (a, 0) = a GCD (b, a mod b) Recall the process of thinking recursively. a) Determine the repetitive steps (recursive task). b) Determine a condition to end the repetition (base case). User input can be any content and it's bold and italicized for clarity. Example Output Enter two positive integers: 20 16 20 16 16 4 40 4

whats a string

Please make additional adjustments to the C++ code. There is only one infrared LED. If a non-moving train is detected (and stops for a few seconds), the LED should be turned on. The LED should always stay turned off if: There is no train detected At least one train bypasses without stopping

With the aid of c++, write a program that asks the user to enter a number.The program then asks the user to enter the number of permutations needed to calculate the lexicographic arrangement of the entered number.Finally the program calculates the lexicographic order of the number entered based on the number of permutations chosen.