parameters and uses recursive backtracking to print all solutions for traveling in the

$2-$D plane from $(0,0)$ to $($x$,$y$)$x x and y $(5,3).$

$-.$

You may assume that the $($x$)/($y$)$ values passed are non$-$negative. If x and y are both $0,$

print a blank line.

The table below shows several calls to your method and the lines of output. Your

lines can appear in any order; our output shown tries the possibilities in the order

listed above: East, then North, then Northeast. travel $\backslash (\backslash$odot $\backslash )$

Language$/$Type:

$$ Java recursion recursive backtracking

Author:

Marty Stepp on $2016/07/08$

Write a recursive method named travel that accepts integers $\backslash ($ x $\backslash )$ and $\backslash ($ y $\backslash )$ as parameters and uses recursive backtracking to print all solutions for traveling in the $2-$D plane from $\backslash ((0,0)\backslash )$ to $\backslash (($x$,$ y$)\backslash )$ by repeatedly using one of three moves:

$-$ East $($E$)$: move right $1($increase $\backslash ($ x $\backslash ))$

$-$ North $($N$)$: move up $1($increase y$)$

$-$ Northeast $($NE$)$: move up $1$ and right $1($increase both $\backslash ($ x $\backslash )$ and $\backslash ($ y $\backslash ))$

The following diagram shows one such path to the point $\backslash ((5,3)\backslash ).$

You may assume that the $\backslash ($ x $/$ y $\backslash )$ values passed are non$-$negative. If $\backslash ($ x $\backslash )$ and $\backslash ($ y $\backslash )$ are both $0,$ print a blank line.

The table below shows several calls to your method and the lines of output. Your lines can appear in any order; our output shown tries the possibilities in the order listed above: East, then North, then Northeast.

Hint: It may help to define a private helper method that accepts different parameters than the original method. In particular, consider building up a set of characters as a String for eventual printing. Do not use any loops in solving this problem.