C code Code: int f(int n) { return(0); if(n==1) return(1); printf("ADD"); return(f(n-1)+f(n-2)); } What general formula can you derive from this if someone was to use f(n)?

Sorry but your code will stop execution at first line, but I suppose you want to obtain recursive algorithm for n-th Fibbonacci number.