Code the three algorithms and Provide the running times of the different algorithms using the given instances. THE CODE MUST BE IN JAVA

Algorithms ALGORITHM1 Euclid(m, n) Input: Two non-negative, not-both-zero integers m and n Output: Greatest Common Divisor of m and n while n = 0 do rem mod n mfn. nfr return m ALGORITHM 2 CICA(m, n) Input: Two non-negative, not-both-zero integers m and n Output: Greatest Common Divisor of m and n tt min(m, n) stop false while stop = false do If m mod t = 0 AND n mod t = 0 stop = true; Else tft-1 return t Algorithm 3 for computing god(m, n) Step 1 If n = 0, return m, else go to step 2 Step 2 If m = 0, return n, else go to step 3 Step 3 if m divides n return m, else go to step 4 Step 4 if n divides m return n, else go to step 5 Step 5 Find the divisors of m Step 6 Find the divisors of n Step 7 Find the common divisors between m and n Step 8 gcd(m, n) = the greatest common divisor between m and n Instances GCD(m,n) tl t2 t3 Instance 1 2 3 4 5 m 1250 178208 1458 25825 2x106 n 25000825 20347796 18497562 99941714720 4x1010