USING JAVA

Write a recursive algorithm with the following signature:

int add$($int $x,$ int y$)$;

that returns x if y is $0$ ; and adds x to y otherwise.

THE FUNCTION MUST BE RECURSIVE.

$($hint: the base case should involve a test for y being $0$ ; recursive case should reduce y towards $0)$

Write a recursive algorithm with the following signature:

int divide$($int x $,$ int y $)$;

that returns $\frac{x}{y}($integer division$).$ You need not test for divide by $0.$

THE FUNCTION MUST BE RECURSIVE. $($hint: base case should be when $x$