Please explain why each statement is either right or wrong, thanks! :-)

What is the time complexity of the following recursive function? int test (int n) { if (n lessthanorequalto 2) return 1: else return test(n-2) * test(n-2): } O (2^n) O (n logn) O(n^2) O(2^n/2)