2. The Tribonacci equation is similar to the Fibonacci equation, but it is defined by the previous three terms instead of the previous two, i.e. T(n) is defined by T(0) 0, T(1) = 1, T(2)-1,T(n + 1) = T(n) + T(n-1) + T(n-2), for n 2. (a) 3 points If we let R(n) T(n 1) and S(n)-T(n 2), we can come up with a linear recurrence relation for the Tribonacci equations similar to the ones we came up with for the Fibonacci equa- tions. Write that system of equations here pay attention to type setting and be sure the resulting (b) 2 points] Translate the linear system you wrote to a matrix equation. Write the matrix equationn (c) 5 points Use your matrix recursion to quickly find the 200'th Tribonacci number. Do not use ations look clean. below, using proper LXTEX style (though there are many ways to create a matrix in LTEX). loops, recursion, or any other technique