Question: a. For a set of six data items, what is the minimum worst-case number of comparisons a search algorithm must perform?
b. Given the set of data items
{a, d, g, i, k, s ],
find an order in which to enter the data so that the corresponding binary search tree has the minimum depth
2. a. For a set of nine data items, what is the minimum worst-case number of comparisons a search algorithm must perform?
b. Given the set of data items {4, 7, 8, 10, 12, 15, 18, 19, 21}, find an order in which to enter the data so that the corresponding binary search tree has the minimum depth.