Question 1 1 pts consider the factorial method factorial(n) if (n--0) return 1 else return n'factorialn-1) Let R(N) be the worst-case running time of a call to factoriallN). We are trying to find an f(N) such that R(N) E O((N)). The diagram will look like a tree. What are the properties of this tree? One call to factorial depends on I Select | . Height of the diagram, or number of levels, is Select) . Given an integer n, the number of steps inside the body of a single call to factorian) is sub-calls to factorial. I Select Y in terms of n (not the same as N). . The number of steps inside the body of a single call to factorial at the ith level of the tree is I Select 1 when expressed in terms of N. Assume the top of the tree