Q3) a) An algorithm with complexity O(N log N) spends 1.0 miliseconds to process an 1000 data items. Estimate how much time it will spend to process N- 1,000,000 data items. (I point) b) A quadratic algorithm spends 1.0 miliseconds for processing N-100 data items. Estimate how much time it will spend to process N 5000 data items. (I point) c) An algorithm with time complexity O(N) spends 10 seconds to process 1000 data items. Estimate how much timet will spend to process 100,000 data items. I point) d) Algorithms A and B spend exactly TA(N)-0.IN2 logo N and TB(N)-1.5 miliseconds respectively, for a problem of size N. 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. For instance, if your problems are of the size n