[1] (20 points) Define a recurrence T(n) for the following code excerpt: public int f(int n) { if(n== 0 || n == 1) return n; else return 7 * f(n-1) - 12 * f(n - 2): }