python 3. please note to use recursion and that it works, e.g. garden(10) is 25

There are n flowers in the garden. Each flower at even position has 2 leaves, and each flower at odd position has 3 leaves. Write a recursive function, garden, that takes a non-negative integer, n and returns the numbers of leaves in the garden. For example, if n is 3, then there is a flower at position 1 with 3 leaves, a flower at position 2 with 2 leaves, and a flower at position 3 with 3 leaves. So, there is a total of 3 + 2+3 8 leaves. def garden(n): garden (3) >>>garden (4) garden (0) 10 # YOUR CODE GOES HERE