Using the lowercase letters a - g. match each algorithm with the best big-O notation that describes its complexity.

a. A binary search of n elements.

b. A linear search to find the smallest number in a list of n numbers.

c. An algorithm that lists all ways to put the numbers 1, 2, , n in a row.

d. An algorithm that prints all bit strings of length n.

The number of print statements in the following:

i := 1, j := 1 while i ? n while j ? i print hello; j := j + 1 i := i + 1

f, An algorithm that prints all subsets of size three of the set {1, 2, 3, , n}

g. The best-case analysis of a linear search of a list of size n (counting the number of comparisons).

1, log2 n, n, n^2, n^3 2^n n!