What are the first five terms of the Fibonacci sequence, and what method allows finding the nth term in constant space and O(n) time complexity?
a) 0, 1, 1, 2, 3; Using recursion
b) 1, 1, 2, 3, 5; Using dynamic programming
c) 0, 1, 1, 2, 3; Using dynamic programming
d) 1, 1, 2, 3, 5; Using recursion