Embark on the Fluffy Adventure Quest by creating a Java program that utilizes the power of recursion to

solve the challenge of exchanging magical fluffy creatures. Your goal is to implement a recursive Java

function that determines the possibility of completing the quest by starting with a given number of

these enchanting beings.

Rules:

If the number of creatures $($n$)$ is even, return exactly n$/2$ creatures.

If n is divisible by $3$ or $4,$ multiply the last two digits of n and return this many creatures. $($Hint:

The last digit of n is n$\%10,$ and the next$-$to$-$last digit is $(($n$\%100)/10)).$

If n is divisible by $5,$ return exactly $42$ creatures.

Tasks:

$1.$ Write a recursive Java function:

The function should return true if completing the Fluffy Adventure Quest is possible by starting

with n creatures, and false otherwise.

As part of your understanding of recursion and its application in the Fluffy Adventure Quest assignment,

please provide explanations for the following key concepts:

$2.$ Recursive Explanation:

Define what recursion means in the context of the Fluffy Adventure Quest assignment.

Explain how the recursive approach helps in solving the quest.

Highlight any specific benefits or advantages of using recursion in this scenario.

$3.$ Base Condition:

Clarify what a base condition is and its significance in recursive functions.

Specifically, elaborate on the base condition in the Fluffy Adventure Quest program.

Discuss why the base condition is essential for the termination of recursive calls.

$4.$ Recursive Conditions:

Define what recursive conditions are and their role in controlling the flow of recursion.

Break down the recursive conditions present in the Fluffy Adventure Quest program