From Question 1:

2. Refer back to the recursion tree you provided in the previous problem. Determine a formula that counts the numbers of nodes in that tree. What is Big-O for execution time? Determine a formula that expresses the height of the tree. What is the Big-O for memory?

My tree for reference:

_ call to shift insertionSort -call to insert 5, 4, 3, 2,1} 4, 5 failed recursion call as condition i>0 4,3. 5 4, 5 3 3,4,2,5 3, 4, 5 4 2,3,4,5 2,3,4,1,5 2,3,4,5 2,3,1,4,5 2,1,3,4,5 1,2,3,4,5 1,2,3,4,5 _ call to shift insertionSort -call to insert 5, 4, 3, 2,1} 4, 5 failed recursion call as condition i>0 4,3. 5 4, 5 3 3,4,2,5 3, 4, 5 4 2,3,4,5 2,3,4,1,5 2,3,4,5 2,3,1,4,5 2,1,3,4,5 1,2,3,4,5 1,2,3,4,5