This is for JAVA

I need to de\sign a program that implements Eu\clids algorithm for fin\ding the greatest common divisor of two positive integers. The greates\t common divisor is the largest integer that d\ivides both values without producing a remainder. Write a RationalNumber class conta\\ining a numerator and denominator as its fields. Write a recursive method (named gcd) that computes and returns the greatest common divisor of the numerator and denominator. Write a driver that prompts the user for a n\umerator and denominator, creates a RationalNumber object and computes and prints the greatest common denominator using the recursive gcd method.