Problem solving

//write the program to fabonacci series and find out the value of the n is index of the fabonacci series re turn the ans of the n index; // time complexity of this code is O(n) = O(c), c = constant ; all this in the function is constant :: // space c...