Problems 1. Sorting Lower Bounds. In class we illustrated the decision tree for insertion sort. You will do the same here but for different sorting algorithms (a) (5 points) Draw the decision tree for mergesort when sorting an array consisting of3 distinct elements. (b) (5 points) Draw the decision tree for (worst-case) deterministic quicksort when sorting an array consisting of 3 distinct elements