What is the worst-case time complexity of linear search and binary search, respectively?
A. $\mathrm{O}(\mathrm{n} \log 2 \mathrm{n}), \mathrm{O}(\log 2 \mathrm{n})$
B. $\mathrm{O}(\log 2 \mathrm{n}), \mathrm{O}(\mathrm{n})$
C. $\mathrm{O}(\mathrm{n}), \mathrm{O}(\log 2 \mathrm{n})$
D. $O(1), O(n)$