(Solved): Order the following list of functions by their big-Oh notation. (From slowest growth rate to faste ...

Order the following list of functions by their big-Oh notation. (From slowest growth rate to fastest growth rate) \[ \begin{array}{l} \mathrm{n}^{0.04} \end{array} \] Determine the closest big Oh notation for each of the following expression in terms of \( \mathrm{n} \) a. \( 7 n^{5}-2 n^{3}+10 n+\frac{2}{n} \) b. \( n^{2}+n \log ^{6} n+n^{2} \log ^{2} n+2 \) c. \( 2 n^{2}+2^{n}+n^{3} \) d. 3342 How does the growable array-based data structure increase the size of the array when it is full? Increase the array size by constant Double the array size empty. If D is empty, iteratively pop every element from \( E \) and push it onto \( D \), until \( E \) is empty, and then call D.pop(). Given the heap, answer the questions a. List all internal nodes following their post order traversal b. Draw the heap after following operations being performed consecutively| (you can draw 3 heaps, one after each operation, to gain partial credits even if the final heap is not correct) 1. insert 23 , 2. removeMin () 3. insert 2