Two friends are arguing about their algorithms. The first one claims his O(n\log n)-time algorithm is always faster than the second friend's O(n^{2})-time algorithm. To settle the issue, they perform a set of experiments. Show that it is possible to find an input n<100 that the O(n^{2})-time algorithm runs faster, and only when n\geq100 that the O(n\log n)-time algorithm is faster.