Students are discussing variations of algorithms to find Fibonacci numbers, like fib(6). What is the best possible time complexity that they can get for this algorithm?(1 point)%0D%0AResponses%0D%0A%0D%0AO(n2)%0D%0Aupper O left parenthesis n squared right parenthesis%0D%0A%0D%0AO(n)%0D%0Aupper O left parenthesis n right parenthesis%0D%0A%0D%0AO(logn)%0D%0Aupper O left parenthesis log n right parenthesis%0D%0A%0D%0AO(1)

Answer 1

The best possible time complexity that they can achieve for the algorithm to find Fibonacci numbers is O(n).