How does the constant of proportionality for an algorithm differ from focusing on the dominant term in big$-$O analysis?

Question $3$ options:

The constant of proportionality involves terms and coefficients that are usually ignored during big$-$O analysis.

The constant of proportionality attempts to calculate the computational cost of N $=$ NP problems.

The constant of proportionality focuses on the dominant term's effects on other parts of the algorithm, rather than focusing solely on the dominant term.

The constant of proportionality involves the creation of a benchmark for items that contribute to the dominant term.