Q1) Does this code satisfy Progress? Q2) Explain your answer in Q1. Q3) If your answer in Q1 is No, what is the solution?

L2= {1010 10ª | a ≥ 0} 5. () Using L₂ from the previous problem, is L₂ € Eo? Circle the appropriate answer and justify your answer. YES or NO 6. () Using L₂ from the previous problem, is L₂ E₁? Circle the appropriate answer and justify your answer. YES or NO

Exercise 1: (Design of algorithm to find greatest common divisor) In mathematics, the greatest common divisor (gcd) of two or more integers is the largest positive integer that divides each of the integers. For example, the gcd of 8 and 12 is 4. Why? Divisors of 8 are 1, 2, 4, 8. Divisors of 12 are 1, 2, 4, 6, 12 Thus, the common divisors of 8 and 12 are 1, 2, 4. Out of these common divisors, the greatest one is 4. Therefore, the greatest common divisor (gcd) of 8 and 12 is 4. Write a programming code for a function FindGCD(m,n) that find the greatest common divisor. You can use any language of Java/C++/Python/Octave. Find GCD Algorithm: Step 1 Make an array to store common divisors of two integers m, n. Step 2 Check all the integers from 1 to minimun(m,n) whether they divide both m, n. If yes, add it to the array. Step 3 Return the maximum number in the array.

How many lines does the following program print, as a function

Can you post the code to solve these?

Need to choose only 1 best answer out of four

9. Please just type the answer.