JAVA

Instructions : Complete the tasks listed below. Assume a standard Cartesian Plane with (x,y) coordinates. You are given a travel direction that allows you to go in only three directions, North, East and North East. In the exercise, you have a recursive solution that lists all the ways to get to (1,2) from the origin (0,0). Where to find starter code in 'my-work' repository package.class : week03\$recursion.TravelDirectionTest Task List 1. Print out the solutions for (1,2). 2. Create a solution that allows you to travel South, West and South West and returns you back to the origin from your position at (1,2). 3. Print out the solutions for (1,2) returning back to (0,0). c) TravelDirectionTest.java