Need assistance creating a recursion tree with activation points based on a Java insertion sort using recursive methods. Also need help developing a formula for this tree and calculating memory and execution Big-O. I have provided sample problems as well.

Need assistance creating a recursion tree with activation points based on a Java insertion sort using recursive methods. Also need help developing a formula for this tree and calculating memory and execution Big-O. I have provided sample problems as well. It is question 1 and 2 specifically.