Do log bases matter in Big O domination?

Question

Given two functions:

f(n)=O(log₂n) and g(n)=O(log₁₀n)

Does one of these dominate the other?

Answer 1

Remember that logs of any base can be converted into a common base that only varies by a constant.

Therefore they both have the same upper bound