Decide true or fafalse to the asymptotic notation

For each of these statements, decide if it is

Always true

Always false

Sometimes true and sometimes false

If it is always true or always false, justify your answer. If it is
sometimes true and sometimes false, give an example of a situation where
it is true and a situation where it is false. For questions that
involve functions f(n) and or g(n), you should assume that the values of
the functions are always positive.

.

The running time of Quicksort on an array of size n is faster than the
running time of InsertionSort on the same array.

f(n)+g(n)=(min(f(n),g(n))).

.