Hi, Can you help me with this Matlab recursion probelm. Thank you.

Problem 1: Recursive Branching Consider a Tribonacci sequence Ti, T2, T3, where the sequence is initialized with Ti-1, T2-1, and T3-2, and the nth Tribonacci number is determined by Tn Tn-2 Tn-3 for n-4, 5, 6,...etc. Mathematically this can be written as a piecewise function T(n -1) + T(n -2) + T(n - 3) n>.3 Write a recursive function Tn - tribNum (n) that takes an integer number n (1xl double greater than 0) and computes the nh Tribonacci number Tn and assigns it to a variable called Tn (1xl double). You can assume that n is always a positive integer. TEST CASE 1 >Tn-tribNum (1) Tn - TEST CASE 2 >Tn-tribNum (2) TEST CASE 3 >>Tn-tribNum (3) 2 TEST CASE 4 >> Tn = tribNum(4) Tn TEST CASE 5 >> Tn = tribNum(5) Tn = TEST CASE 6 > Tn-tribNum (20) Tn = 66012