1. Decision trees provide an abstraction for comparison sort algorithms.

A. Draw a decision tree for Insertion sort on 4 elements.

B.What is the shortest path in the decision tree? What does this represent from Insertion sort algorithm standpoint?

C. What is the longest path in the decision tree? What does this represent from Insertion sort algorithm standpoint?

D. How many leaves are there in the decision tree? What does this represent from Insertion sort algorithm standpoint?

2. Assume we have n integers that range from 0 to n5-1 in value. What will be the algorithmic complexity of sorting these numbers by using Radix sort? Show work.