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)

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?

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

Total sum of QuotientsMax. score: 40Given an array A of N integers and an integer S. Write an efficient program to find the minimum X such that X divides all the elements of A, the total sum of the quotients doesn’t exceed S. Consider integer division while dividing elements of the array.Input format:First line contains two spaced integers N and S.Second line contains N space separated integers of A.Output format:Print single integer representing X.SAMPLE INPUT 6 2710 8 8 11 14 19SAMPLE OUTPUT 3ExplanationIf N=6, S=27 and A=[10,8,8,11,14,19]If all elements are divided by 1, i.e, then the total sum of quotients of elements in A is 70, which is greater than S. So X shouldn’t be 1.If X=2, then the total sum of quotients of elements in A becomes 34, which is also greater than S.If X=3, the total sum becomes 20, which is less than S. Therefore the output is 3 because 3 is the minimum number where quotient’s sum goes less than S for the first time.Constraints:1<=N<=10^51<=A[i],S<=10^9

The arithmetic mean of nine consecutive whole numbers equals 2006. The largest of these nine numbers isA. 2007B. 2009C. 2010D. 2011E. 2012

__________ algorithm does not work correctly when one of its input numbers is zeroQuestion 2Answera.Middle School Procedureb.None of the abovec.Consecutive integer checkingd.Euclids