C-1.7 Al and Bill are arguing about the performance of their sorting algorithms. Al claims that his O(n logn)-time algorithm is always faster than Bill's O(n2)-time algorithm. To settle the issue, they implement and run the two algorithms on many randomly generated data sets. To Al's dismay, they find that if n 100 is the O(n logn)-time algorithm better. Explain why this scenario is possible. You may give numerical examples