1. Sorting-
(a) Draw the comparison tree to show the comparison steps to sort the following data, which represents four hexadecimal memory addresses: 0x0A170, 0xB105, 0xA000, and 0xAFFE0. Also, highlight the path and node in the tree that shows the list in sorted numerical order.
2. Searching and Hashing-
(b) Briefly describe what double hashing is and describe what problem double hashing helps to resolve. Also, provide an example of a rule that can be used for a double hashing probe sequence.