What is the minimum number of divisions made by Euclid’s algorithmamong all inputs 1 ≤ m, n ≤ 10?b. What is the maximum number of divisions made by Euclid’s algorithmamong all inputs 1 ≤ m, n ≤ 10?

The maximum number of divisions performed in consecutive integer checking algorithm is_________Question 9Answera.mean(m,n)b.max(m,n)c.min(m,n)d.count(m,n)

Which of the following is a Divide and Conquer algorithm?

During determination of GCD, division by 0 problem occurs in ________________ algorithmQuestion 7Answera.All of the aboveb.Consecutive integer checkingc.Euclidsd.Middle School Procedure

You are given an array A of size NLet M be the minimum value present in the array initiallyIn one operation, you can choose an element Ai ( 1 ≤ i ≤ N ) and an integer X ( 1 ≤ X ≤ 100 ), and set Ai = X.Determine the minimum number of operations required to make M the maximum value in the array A.

The extended Euclid’s algorithm determines not only the greatest commondivisor d of two positive integers m and n but also integers (not necessarilypositive) x and y, such that mx + ny = d.a. Look up a description of the extended Euclid’s algorithm (see, e.g., [KnuI,p. 13]) and implement it in the language of your choice.b. Modify your program to find integer solutions to the Diophantine equationax + by = c with any set of integer coefficients a, b, and c