Question: Write a scheme function (tribonacci n). The tribonacci numbers Ti are defined as T0 = T1 = 0, T2 = 1, and TN = TN-1
Write a scheme function (tribonacci n). The tribonacci numbers Ti are defined as T0 = T1 = 0, T2 = 1, and TN = TN-1 + TN-2 + TN-3. (tribonacci n) should return Tn. tribonacci and any helper functions must be tail recursive.
Need help writing this in scheme. Thanks
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
