Verizon LTE 10:58 AM Personal Hotspot: 1 Connect O aamu.blackboard.com . Illustrate the Euclid algorithm (recursive way) to find GCD of the following two numbers: 672, 3780. Also, find out how many recursive calls are involved in finding the GCD 2. Write a recursive function that would take an integer N as input and it will display all the numbers starting from N down to 1. Complete the program, by writing the main, and calling it with suitable values of N Given the following integer numbers: 24, 17, 6, 19, 1 0,4,-2 Using Insertion Sort, sort these data in "increasing order" (from lowest to highest value). Compute the runtime as well. Use the table n below 4. Given the following function int Fn(int N) if(N1) return 5: else return 2 + Fn(N/2); Answer the following questions: ) What type of function is this-iterative or recursive? Explain b) Determine the value of Fn(15) Show all the steps. s Given the following data: Using the last element as the pivot, illustrate the Hoare Partition Algorithm. What would be the runtime in terms of number of comparisons