There is a unique decision tree T for quicksort on five element a1, a2, a3, a4, a5. Draw the portion of the tree T showing the path from the root node to the leave node < a5, a4, a3, a2, a1 >. For each node, you need to show the comparison made. For each edge, you need to label it with either YES or NO.