Utilize a Java Integrated Development Environment $($IDE$)$ to write the program provided below. Once completed, thoroughly test the program for functionality. Afterward, copy the code and paste it into a Microsoft Word or Notepad file. Finally, upload the file to the Canvas course for assessment.

$*18\mathrm{.}3($Compute greatest common divisor using recursion$)$ The $gcd(m,n)$ can also be defined recursively as follows:

If $m\%$ is $0,gcd(m,n)$ is $n.$

Otherwise, $gcd(m,n)$ is $gcd(n,m\%n).$

Write a recursive method to find the GCD$.$ Write a test program that prompts the user to enter two integers and displays their GCD$.$