Counting Nickels: Recursive Solution

Write a static method named calculateNickelsValue$($int quantity$).$ This method will return a value of nickels in dollar format $($please take into consideration you may have partial dollars in your result$).$

Your task is to implement this method recursively to calculate the total value in dollars for a given quantity of nickels using a recursive solution.

Follow these steps:

Figure out the base case, which will return value of a nickel multiplied by the input parameter quantity.

Otherwise, divide the parameter quantity value by $2,$ and return the sum of two calls to calculateNickelsValue$()$ with half and secondHalf $($these two variables should add up to quantity$).$ IN JAVA