QUESTION 26 This structure is the best model for describing the chapters and sections and subsections of a textbook. Array o Stack Queue Tree QUESTION 27 Given that values is of type LlNode prints the list from start to end prints the first element on the list prints the last element on the list prints the list in reverse order QUESTION 29 What are the argument constraints for the following code? int factorial(int nx (n = 0 return 1; else return (n factorial(n-1)): There are none argument must be less than 0 argument must be greater than or equal to 0 argument must be greater than or equal to 1 QUESTION 30 Starting with an empty stack the sequence of operations push(1).push(2), push(3), pop(), leaves the stack, from top to bottom, as: 1, 2, 3 3.2.1 2,3 2.1