explain the concept of big o(h) notation, including why it may provide for a better measure of an algorithm’s performance than timing a program’s execution on a machine. (b) for each of the following pairs of functions f(x) and g(x), determine if f(x) = o(g(x)), g(x) = o(f(x)), or both, and briefly explain your answers: