time complexity of recursive(fibonacci series Function) how is this equation being reduced to claculate the time complexity of T(n)?
