Question 9 5 out of S points What is the smallest order of magnitude (Big-O) among the following? O(n log n) O(n2) Ollog n) O(n) Question 10 3 out of 5 points What is the computational complexity (Big O order of magnitude) of the following function? 3n2+ 400n2logn+1200 Question 11 4 out of 4 points Which of the following is an example (or examples) of a correct way to use a generic type? (you may select zero, one, or more answers) Question 12 0 out of 6 points Write a recursive method called factorialint n). This method computes the product of the first i integers by recursively calling itself until it reaches its base case. For example, factorial(3) should return 3 2 1-6 Question 13 5 out of 5 points Conceptually, a linked list is a set of nodes, say of type Node, with two fields, one containing data, and one containing an element of type [)