Rewrite the following code (both the recursive call and non-recursive call) in Java. JS script.js 1 function

Rewrite the following code (both the recursive call and non-recursive call) in Java.

Transcribed Image Text:

JS script.js 1 function countDown (n) { 2 3 4 5 for (let i = n; i > 0; i--) { console.log(i) console.log('Hooray') } 6} 7 9 8 function countDown Recursive(n) { if (n <= 0) { console.log('Hooray') } 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 return } return console.log(n) countDown Recursive (n return - countDownRecursive (3) countDown Recursive (2) countDown Recursive(1) count DownRecursive (0) return return 1) JS script.js 1 function countDown (n) { 2 3 4 5 for (let i = n; i > 0; i--) { console.log(i) console.log('Hooray') } 6} 7 9 8 function countDown Recursive(n) { if (n <= 0) { console.log('Hooray') } 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 return } return console.log(n) countDown Recursive (n return - countDownRecursive (3) countDown Recursive (2) countDown Recursive(1) count DownRecursive (0) return return 1)

Answer rating: 100% (QA)

Heres the rewritten Java code for both the nonrecursive and rec... View the full answer