1. (20 points) Assume the processing time of an algorithm of Big-Oh complexity Off(n)) be directly proportional to f(n). Let three such algorithms A, B, and C have time complexity O(n), O(nlog n), and O(n), respectively. During a test, each algorithm spends 8 milliseconds to process 128 data items. Derive the time each algorithm should spend to process 22 items