Hello, can somebody tell me the time complexity of this code? and whether if it uses Dynamic programming/Memoization strategy? Thank u thumbs up will be given!

private static int f(int n)f if (n -e) return 1; if (n--2) return 3; if (n--1) return -1; if( (n%2)--0) return 4*f(n-2)-f (n-4); else return 0; public static void main(String[] args) Scanner scannernew List(); while(scanner.hasNextInt())f int n = scanner.nextInt(); input.add (n); int[] output - new int[input.size()1; for( int i = e; i