In the recurrence T(n)=T(n−1)+O(1)T(n) = T(n-1) + O(1)T(n)=T(n−1)+O(1), what is the total complexity?
O(n)O(n)O(n)
O(n2)O(n^2)O(n2)
O(logn)O(\\log n)O(logn)
O(2n)O(2^n)O(2n)