Java language

CSC 1351, Fall 2018, Lab 5 Name this proiect Recursive AuxiliaryMath NOTE: Implement the following 4 methods using recursion. Do not use any loops in the implementation of these 4 methods Definition 1. A palindromic number is a non-negative integer which stays the same when its digits are reversed. Both 159951 and 4782874 are palindromic numbers but 12345321 is not Definition 2. The Fibonaccl numbers are the numbers in the following integer sequence: 0,1, 1,2.3,5,8,13,21,34,55, By definition, fibonacoi(o)-0, fibonacc(1)-1, and each subsequent number is the sum of the previous two. Definition 3. The greatest common denominator, denoted GCD, of two or more integers is the largest posiltive integer that can evenly divide the numbers For example, the GCD of 12, 15 and 30 is 3. When computing the GCD of two integers, i exactly one of the number is O, their GCD is the non-zero number. When computing the GCD of two numbers, if both numbers are 0, their GCD is indeterminate. input : a, b: integer output god(a.b) intialization f a 0 AND b-0 then god - NaN: else if a 0ORb 0 then else while b 0 do r - remaindera.b): a -b: b-r end end ithm: use recursion instead NOTE: Do not use any loops in the implementation of this algor