For the following program fragment, give an analysis of the running time in terms of Big O and provide a brief justification.

int f1(int n) {

if (n < 10) {

System.out.println("!");

return n+3;

} else {

return f1(n-1) + 1;

}

}