Answer
--A recursive algorithm to find the nth term of the given sequence
Work Step by Step
--procedure a(n: nonnegative integer)
-if n = 0 then return 1
-else
- if n = 1 then return 2
-else
- return a(n − 1) · a(n − 2)
You can help us out by revising, improving and updating this answer.
Update this answerAfter you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.