Write an algorithm that accepts as its input two numbers, and returns the greatest common divisor (gcd) of those two numbers. note that this is also known as the euclid algorithm and is mentioned briefly in the lecture about algorithms. check out the link on the slides to get a better idea how this works hm since it will show up

Acommon algorithm for converting a decimal number to binary is to repeatedly divide the decimal number by 2 and save the remainder. this division is continued until the result is zero. then, each of the remainders that have been saved are used to construct the binary number.write a recursive java method that implements this algorithm.it will accept a value of int and return a string with the appropriate binary character representation of the decimal number.my code: public class lab16{public string converttobinary(int input){int a; if(input > 0){a = input % 2; return (converttobinary(input / 2) + "" +a); } return ""; } }