1.) An algorithm with the O (2ⁿ) time complexity is called an exponential algorithm.

Group of answer choices

True

False

2.) The average-case and worst-case complexity for merge sort O ( log n).

Group of answer choices

True

False

3.) Bucket sort and radix sort are specialized sorting algorithms for integer keys. These algorithms sort keys using buckets rather than comparing keys. They are less efficient than general sorting algorithms.

Group of answer choices

True

False