iven a positive integer N, find the Nth Even Fibonacci number. Since the answer can be very large, return the answer modulo 1000000007. Example 1:

Input: n = 1 Output: 2 Explanation: 2 is the first even number in the fibonacci series. 

Example 2:

Input: n = 2 Output: 8 Explanation: 8 is the second even number in the fibonacci series.

Your Task: You dont need to read input or print anything. Complete the function nthEvenFibonacci() which takes S as input parameter and returns the Nth even fibonacci number. Expected Time Complexity: O(n) Expected Auxiliary Space: O(n) Constraints: 1<= n <=1000

// { Driver Code Starts //Initial Template for Java import java.util.*; import java.io.*; class GFG { public static void main(String args[]) throws IOException { BufferedReader read = new BufferedReader(new InputStreamReader(System.in)); int t = Integer.parseInt(read.readLine()); while (t-- > 0) { long n = Integer.parseInt(read.readLine()); Solution ob = new Solution();

System.out.println(ob.nthEvenFibonacci(n)); } } }// } Driver Code Ends

//User function Template for Java

//User function Template for Java class Solution { static long nthEvenFibonacci(long n){ // code here } }