Suppose that n equals $1$ million. Approximately how much faster is an algorithm that performs nlgn operations versus one that performs n$^2$ operations? Recall that lg is the base$2$ logarithm function.