6. (10 pts) Compare the running times in table 1.1, sort all running times from the lowest to the highest when n is very large. 1 2 3 4 5 6 7 8 9 10 100 logn 2vn 3nnlogn 2n2 | n3 2nnn loglognn! f(n) Ordering results: Table 1.1: List of running times