write a java recursion code that does the following:

Exercise 4 Triple Step: A child is running up a staircase with n steps and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a recursive method to count how many possible ways the child can run up the stairs. For example: countWays(3) Answer = 4-> ( l , l , l ), ( 1 ,2), (2, 1 ), (3) For example: countWays (15) Answer 5768