1. Write a java program to compute the greatest common divisor of two integers, where it can be written recursively by: (1 Mark). gcd(x,y)={xgcd(y,remainder(x,y))ify=0ify>0 2. Write a Java program to Search an Element in an Array Using Binary Search with Recursion Method(1 Mark)