Question 2 Question 2 Compute the Leonardo numbers by recursion The Leonardo numbers are a sequence of integers defined as follows: n 0 L(n) = 1 LG-1)+ L(n 2)+1 17 2 2 Write a static method public static int leonardoRec(int n) that computes leonardoRec(n) by using recursion. (You may again assume that the input is always non-negative) Use the function leonardoRec to print a table of the results for inputs 0 through 9