Algorithm domination

Question

Studying for a test and getting this question:

Comparing two algorithms with asymptotic complexities O(n) and O(n + log(n)), 
which one of the following is true?

A) O(n + log(n)) dominates O(n)
B) O(n) dominates O(n + log(n))
C) Neither algorithm dominates the other.

O(n) dominates log(n) correct? So in this do we just take o(n) from both and deduce neither dominate?

Answer 1

[C] is true, because of the summation property of Big-O

Summation 
O(f(n)) + O(g(n)) -> O(max(f(n), g(n))) 
For example: O(n^2) + O(n) = O(n^2)

In Big-O, you only care about the largest-growing function and ignore all the other additives.

Edit: originally I put [A] as an answer, I just didn't put much attention to all the options and misinterpreted the [A] option. Here is more formal proof

O(n) ~ O(n + log(n))      <=>
O(n) ~ O(n) + O(log(n))   <=>
O(n) ~ O(n).

Answer 2

Yes, that's correct. If runtime is the sum of several runtimes, by order of magnitude, the largest order of magnitude dominates.