Put these functions in order. Put the following functions in a list by increasing order of growth. That means, in your final list, if f comes before g, then f& O(g). Iff& O(g) meaning they have the same order of complexity, then either one can come first. n log n 100m + 6n 2n 12n 70.51 3n 1/n n-324 232n a) Write the functions in their increasing order of growth nlog n 50n0.5 log2 n b) State which functions fall into the same order (that is, have the same order)