Exercise 1. (4 points) To illustrate how the asymptotic notation can be used to rank the efficiency of algorithms, order the following functions in terms of their big Oh characterization in increasing order indicating when they are equal). n log n, 22, n (n2-n+1)', 2" logs n, log2 n