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

__________ 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

How many steps of Euclid's algorithm does it take to calculate gcd(19,15), assuming the algorithm terminates the first time a remainder is zero? Group of answer choices 3 5 4 2

Find gcd(31415, 14142) by applying Euclid’s algorithm.b. Estimate how many times faster it will be to find gcd(31415, 14142) byEuclid’s algorithm compared with the algorithm based on checking con-secutive integers from min{m, n} down to gcd(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?

Develop a Java program to find the GCD (Greatest Common Divisor) of two numbers.Input FormatTwo integers a and b separated by a space.ConstraintsThe absolute values of a and b will be less than or equal to 10^9. a and b are non-negative integers.Output FormatA single integer representing the GCD of a and b.Sample Input 012 18Sample Output 06Contest ends in an hourSubmissions: 0Max Score: 5Difficulty: EasyRate This Challenge: More Java 151import java.io.*;2import java.util.*;3​4public class Solution {5​6    public static void main(String[] args) {7        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */8   }9}