@@ -0,0 +1,475 @@
+class ClassicRecursion %7B%0A    private static final int MAX = 4000000;%0A%0A    private static int sumFib(int first, int second) %7B%0A        int next = first + second;%0A        int base;%0A        if (next %3C MAX) %7B%0A            base = sumFib(second, next);%0A        %7D else %7B%0A            base = (next %25 2 == 0) ? next : 0;%0A        %7D%0A        return base + (second %25 2 == 0 ? second : 0);%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        System.out.println(sumFib(1, 2));%0A    %7D%0A%7D%0A

add classic recursion java solution for problem 2