Put the following growth functions in order: 3 100logn, 10nlogn, 10000, 2n2, 10000.5n Put the following growth functions in order: 0(n log n), 0(log n), 0(1) , O(2n ), O(n) , O(n*) , O(n2 ) Briefly describe an algorithm for finding the max element in an array Analyze the time complexity (Big-Oh) of the algorithm. Briefly describe an algorithm for removing duplicates from an array. Analyze the time complexity (Big-Oh) of the algorithm. Analyzing the time complexity (Big-Oh) for the following code: for (j = 0; j