1) Give the decision tree of the QuickSort above (the textbook version) when it runs on a 3 element sequence . 2) Assume a decision tree is given that corresponds to a comparison-based sorting algorithm running on an n- element sequence. - What's the length of the shortest path in a decision tree correspond to? - What's the length of the longest path in a decision tree correspond to? Quicksort: review Quicksort(A, p, r) if p