Java program to find n - th term of a recursive function using matrix exponentiation .
class GfG { static int MAX = 100 ; static int MOD = 1000000009 ; static int power ( int n ) { if ( n <= 1 ) { return 1 ; }