How to sort a array a step 1: copy each element from a into an avl tree step 2: copy each element from the avl tree back into the array assuming the array has n elements, what is the algorithmic execution time for step 1? what is the algorithmic execution time for step 2? recall that insertion sort and quick sort are examples of algorithms that can have very different execution times depending upon the distribution of input values. is the execution time for this algorithm dependent in any way on the input distribution? o(n); a sorted dynamic array bag also maintained elements in order. why would this algorithm not work with that data structure? what would be the resulting algorithmic execution time if you tried to do this?