My Courses & Academics -oakton.edu d2l.oakton.edu D2L Grammar Lessons & Assignment - EGL-076-0C1 - Acd Wrt Non-Nat Spkr D2L Question 1 The following code is supposed to return n!, for positive n. An analysis of the code using our "Three Question" approach reveals that: int factorial (int n) { if (n > 0) return (n factorial (n - 1)); } it fails the base-case question. O it fails the smaller-caller question. it fails the general-case question. it passes on all three questions and is a valid algorithm. + DO Quiz Submissions - Homework 3 - CSC-241-0C1 Java Data Structures - Oakton... 0 / 5 points Question 2 Assuming values is a full array of int, what does the following recursive method return (assume it is passed a legal argument, a value between 0 and values.length)? int mystery (int n). { } if (n values.length) return 0; else return (n mystery (n + 1));B the sum of the values in the array between index n and the start of the array the sum of the values in the array between index n and the end of the array the number of values in the array between index n and the start of the array the number of values in the array between index n and the end of the array None of these is correct. Question 8 The order of growth for the depth of recursion associated with the text's recursive combinations (returns C(group, members)) method is: 0 / 5 points 0 / 5 points d2l.oakton.edu My Courses & Academics - oakton.edu D2L Grammar Lessons & Assignment - EGL-076-0C1 - Acd Wrt Non-Nat Spkr the sum of the values in the array between index n'and the start of the array the sum of the values in the array between index n and the end of the array the number of values in the array between index n and the start of the array the number of values in the array between index n and the end of the array None of these is correct. Question 8 The order of growth for the depth of recursion associated with the text's recursive combinations (returns C(group, members)) method is: Done O(1). O(log2N). O(N). O(N2). O(2N). C G> + 88 D2L: Quiz Submissions - Homework 3 - CSC-241-0C1 - Java Data Structures - Oakton... 0 / 5 points Attempt Score: 35 / 50-70% Overall Grade (average of all attempts):35 / 50 - 70 % My Courses & Academics -oakton.edu d2l.oakton.edu D2L Grammar Lessons & Assignment - EGL-076-0C1 - Acd Wrt Non-Nat Spkr D2L Question 1 The following code is supposed to return n!, for positive n. An analysis of the code using our "Three Question" approach reveals that: int factorial (int n) { if (n > 0) return (n factorial (n - 1)); } it fails the base-case question. O it fails the smaller-caller question. it fails the general-case question. it passes on all three questions and is a valid algorithm. + DO Quiz Submissions - Homework 3 - CSC-241-0C1 Java Data Structures - Oakton... 0 / 5 points Question 2 Assuming values is a full array of int, what does the following recursive method return (assume it is passed a legal argument, a value between 0 and values.length)? int mystery (int n). { } if (n values.length) return 0; else return (n mystery (n + 1));B the sum of the values in the array between index n and the start of the array the sum of the values in the array between index n and the end of the array the number of values in the array between index n and the start of the array the number of values in the array between index n and the end of the array None of these is correct. Question 8 The order of growth for the depth of recursion associated with the text's recursive combinations (returns C(group, members)) method is: 0 / 5 points 0 / 5 points d2l.oakton.edu C My Courses & Academics - oakton.edu D2L Grammar Lessons & Assignment - EGL-076-0C1 - Acd Wrt Non-Nat Spkr the sum of the values in the array between index n'and the start of the array D2L: Quiz Submissions - Homework 3 - CSC-241-0C1 - Java Data Structures - Oakton... the sum of the values in the array between index n and the end of the array the number of values in the array between index n and the start of the array the number of values in the array between index n and the end of the array None of these is correct. Question 8 The order of growth for the depth of recursion associated with the text's recursive combinations (returns C(group, members)) method is: Done O(1). O(log2N). O(N). O(N2). O(2N). 0 / 5 points Attempt Score: 35 / 50-70% Overall Grade (average of all attempts):35 / 50 - 70 % G> + 88