plz code in java

Project Fibonacci You are to write a recursion routine to generate the kth term of a "modified" Fibonacci sequence. Our modified sequence will be defined as follows: mod Fibonacci (0-3 mod Fibonacci (1) 5 modFibonacci(2) 8 mod Fibonacci(n) modFibonacci (n -1) modFibonacci (n -2) modFibonacci (n-3) For your convenience several terms of this sequence are: 16 29 53 98 Call your new class ModFib and create a static method in it called modFibonacci Test your new class with the following Tester class import java.io. import java util. public class Tester public static void main(String argsD Scanner kbReader new Scanner(System.in). System.out print ("Generate which term number? int k kbReader.nextInt(); System out println("Term +k+" is ModFib.modFibonacci(k)); Typical runs should look like this: Generate which term number 5 Term #5 is 53 Generate which term number 6 Term #6 is 98