Need help with the following questions, this is for a CSC Data Structures course.

a) Order the following growth rates from smallest to largest.

n2 n! n log n 2n n log n

b) An algorithm has:

a. none of the above

b. space requirements

c. both a & b

d. time requirements

c) Why is it a safer practice for the toArray method to return a copy of the array instead of a reference to the array?

d) The following code is the implementation of ArrayBag class method. Write the appropriate method name on the blank line. (Hint: BagInterface contains method specifications) public { checkIntegrityo: T[] result = (T[])new Object[numberOfEntries); for (int index = 0; index