Which of the following is true regarding a recursion tree for T(n)=T(n−1)+O(1)T(n) = T(n-1) + O(1)T(n)=T(n−1)+O(1)?
The tree has a branching factor of 2
The tree is a simple path (linear chain)
The depth is logn\log nlogn
The work done at each level increases exponentially