2. For the following method please complete the subtasks below: public int mystery (int n) {...

Transcribed Image Text:

2. For the following method please complete the subtasks below: public int mystery (int n) { } int result = 0; if (n <= 3) else result = 1; result= mystery (n/3) + mystery (n/6); return result; a. Identify whether this is a tail or non-tail recursion, and WHY. b. State the base case of this recursive method (if there's any). c. Trace the call mystery (36) by showing either a block map or a stack of activation records step by step, then d. clearly state what the "result" would be for mystery (36). e. Will the recursive call always be able to reach the base case? Why or why not? 2. For the following method please complete the subtasks below: public int mystery (int n) { } int result = 0; if (n <= 3) else result = 1; result = mystery (n/3) + mystery (n/6); return result; a. Identify whether this is a tail or non-tail recursion, and WHY. b. State the base case of this recursive method (if there's any). c. Trace the call mystery (36) by showing either a block map or a stack of activation records step by step, then d. clearly state what the "result" would be for mystery (36). e. Will the recursive call always be able to reach the base case? Why or why not? 2. For the following method please complete the subtasks below: public int mystery (int n) { } int result = 0; if (n <= 3) else result = 1; result= mystery (n/3) + mystery (n/6); return result; a. Identify whether this is a tail or non-tail recursion, and WHY. b. State the base case of this recursive method (if there's any). c. Trace the call mystery (36) by showing either a block map or a stack of activation records step by step, then d. clearly state what the "result" would be for mystery (36). e. Will the recursive call always be able to reach the base case? Why or why not? 2. For the following method please complete the subtasks below: public int mystery (int n) { } int result = 0; if (n <= 3) else result = 1; result = mystery (n/3) + mystery (n/6); return result; a. Identify whether this is a tail or non-tail recursion, and WHY. b. State the base case of this recursive method (if there's any). c. Trace the call mystery (36) by showing either a block map or a stack of activation records step by step, then d. clearly state what the "result" would be for mystery (36). e. Will the recursive call always be able to reach the base case? Why or why not?

Answer rating: 100% (QA)

a Tail or Nontail Recursion This is a nontail recursion becau... View the full answer