In JAVA,

1/Write a static method named containDigit that accepts two integer parameters a, and b.

Assume that a is a positive integer (>0) and b is single-digit numbers from 0-9 inclusive.

Your method should return;

true if a contains b at among its digits, and

false otherwise.

2/ Write a method called gcd that accepts two random integers in the range of [32,256] as parameters and returns the greatest common divisor (GCD) of the two numbers (by using of while loop).

thank you