Can anyone help with these please

Draw the portion of the decision tree for insertion sort on 5 elements a1,a2,a3,a4,a5 that contains the path from the root node to the permutation < a3,a2,a1,a5,a4 >.

Draw the portion of the decision tree for quicksort on 5 elements a1,a2,a3,a4,a5 that contains the path from the root node to the permutation < a3,a2,a1,a5,a4 >.

T(n) = 6T(n/2)+n3. Use the master method to solve T(n). You need to specify a, b, logb a, and decide the case. You also need to write the derived conclusion.