(Solved): Tribonacci number The Tribonacci sequence \( T_{n} \) is defined as follows: \( T_{0}=0, T_{1}=1 ...

Tribonacci number The Tribonacci sequence \( T_{n} \) is defined as follows: \( T_{0}=0, T_{1}=1, T_{2}=1 \), and \( T_{n}=T_{n-1}+T_{n-2}+T_{n-3} \) for \( n>=3 \). Given \( n \), return the value of \( T_{n} \). Exercise 3. Dynamic programming using list Recursive and memoization has linear complexity with the trade off of some space. However, it still involves linear number of recursive calls. Thus, we can make use of a list to avoid recursive calls. [ ] 1 \# test case 1 2 test(tribo_dp, 0,0\( ) \) 3 test(tribo_dp, 1,1) 4 test(tribo_dp, 2, 1) Passed Passed Passed [ ] 1 \# test case 2 2 test(tribo_dp, 3, 2) 3 test(tribo_dp, 4, 4) 4 test(tribo_dp, 5, 7) Passed Passed Passed