Q21. The binary search algorithm is the optimal ____ case algorithm for solving search problems by the comparison method. a. best b. average c. worst d. second best Q22. The sequential search algorithm is the optimal worst-case algorithm for solving search problems by the comparison method. a. true b. false Q23. Both random and quadratic probing eliminate ____. a. primary clustering b. secondary clustering c. rehashing d. random probing Q24. In chaining, the average number of comparisons for an unsuccessful search is equal to the load factor. a. true b. false Q25. What is usually returned if the search item is found during a search of a list? a. the location of the element b. the element c. -1 d. true Q26. What is the maximum number of key comparisons made when searching a list L of length n for an item using binary search? a. log n b. 2 * log2n + 2 c. 2 d. n Q27. In the binary search algorithm, two key comparisons are made through every iteration of the loop. a. true b. false Q28. One way to solve secondary clustering is with double hashing. a. true b. false Q29. Binary search can be performed on both sorted and unsorted lists. a. true b. false Q30. Comparison-based search algorithms search the list by comparing the target element with the list elements. a. true b. false