Select all comparisons performed by Quicksort when sorting [5, 3, 2, 1, 7, 8, 4, 6] using the stable partitioning procedure described in class. The order of the pair does not matter ( 5-3 is equivalent to 3-5). You may find running the provided hw7.Quicksort class to be useful. The answers for the first partitioning operation are provided for you: 5-3, 5-2, 5-1, 5-7, 5-8, 5-4, 5-6, ... Do not select duplicates \fList all comparisons performed when Inserting [5, 3, 2, 1, 7, 8, 4, 6] into a BST. Give your comparisons in the order they occur, writing the pivot first. Put only a comma and a space between pairs. The first few have been provided for you, so you should not include them in your answer: 5-3, 5-2, 3-2, Enter your answer here What do you observe about the ordered set of comparisons performed by Quicksort (Q) vs. BST insertion (B) in earlier questions? O Vq E Q, 3b E B such that q = = b O Vb E B, 3q E Q such that b = = q 1Q1 > |B 1QI < |B O Their orderings are the same O Their orderings are different.Give an example of a comparison performed by Mergesort if passed [5, 3, 2, 1, 7, 8, 4, 6 ] that is not given in your answers to questions 1 or 2. Enter your answer here