QUESTION 13 The number of recursive calls that a method goes through before returning is called: order of growth efficiency the depth of recursion activation stack frame 0 combinatorial recursive count. QUESTION 14 (N+1)(3N) 5N2 + 27 +17) is O/N) True False QUESTION 15 In Java, the class is the root of the inheritance tree . QUESTION 16 Define a stack a TTTT Paragraph. Arial # 3 (12) 3.E.T. TT. 225--- fu Mashup QUESTION 10 Recall that within the ArrayBoundedStack the topindex variable holds the index of the elements array where the current top of stack is stored. If a stack is empty, then its topindex variable is: . 1 DEFCAP QUESTION 11 What does the following return, when passed the argument 1564? Int recurfint n) 1 in