JAVA CODE) Write a recursive algorithm where when 3 values are given, each value after will be the sum of the last 3 values. For example, given 1,2, 3 the next value would be 6. Then given 1,2,3, 6 the next value would be 11. Then given 1, 2, 3, 6,11 the next value would be 20. If we were to call this algorithm like sumOfThree(5), it should repeat 5 times. so that the output would be 20.

b) could you use tail recursion?