Consider the following scenario. You have two solutions to solve a given problem. Option As time efficiency is in O(n log n), while Option Bs time efficiency is in O(n2). You, therefore, hypothesize that Option A is always better than Option B. Yet when you test the two competing methods, you find that Option A is only faster if n is at least 100 (n >= 100). Option B is faster if n is less than 100 (n < 100). How is this possible? Can you explain it by giving a specific example by comparing two algorithms?