True/False Indicate whether the statement is true or false 1. The analysis of algorithms enables programmers to decide which algorithm to use for a specific applicati 2. The keys of the items in a data set are used in such operations as searching, sorting, insertion, and deletio 3. The same probe sequence is used for two nonidentical keys because random probing and quadratic probi are functions of the original key 4. A sequential search works efficiently for large lists. . Insertion sort cannot be applied to linked lists. 6. Once the sublists are sorted, the next step in mergesort is to merge the sorted sublists. 7. The class implementing the properties of a B-tree must, among others, implement the search, traversal, insertion, and deletion algorithms. A search in a B-tree must start at the bottom node. When inserting into a B-tree, if the key is already in the tree, you should output an error message. that are adjacent to the leaf 8. 9. 10. When deleting from a B-tree, if the leaf contains only the minimum number of keys, look at the sibling Multiple Choice Identify the choice that best completes the statement or answers the question. A binary search can be performed only on a. unordered lists b. arrays 11. ? c. comparable lists d. ordered lists 12. sort sorts the list by moving each element to its proper place. 13. In the elements of the list are viewed as sublists at a particular distance. 14. In a queue, customers or jobs with higher priorities are pushed to the front of the queue. a. Quick b. Bubble c. Selection d. Insertion a. quicksort b. Shellsort c. bubble sort d. insertion sort a. structured b. divided c. priority d. hold To speed up item insertion and deletion in a data set, use a. arrays b. linked lists 15. c. classes d. ADTs 16. The item insertion, deletion, and lookup operations require that the binary tree be