2. (20 points) Algorithms A and B spend exactly TA(n) = CA n log n and TB(n) = CB n microseconds, respectively, for a problem of size n. Algorithm A is found to spend 10 microseconds to process 1024 items while algorithm B spends only 1 microsecond to process the same number of items. Choose the algorithm, which is better in the Big-O sense, and find out a problem size no such that for any larger size n > no the chosen algorithm outperforms the other. Find the best algorithm for processing n = 218 data items