11. Suppose a time complexity analysis yields 5000n +(1/1000) n+n-2. What would be the Big O value? 12. Willa O(n) algorithm generally always win in a time-race over a O(n) algorithm? 13. Which is generally the fastest for large n, O(log n) or O(2")? 14. An algorithm has a time complexity of the order 2". How many times more slowly would this algorithm run when n=200, as compared to n - 100? 15. for(j - 0:j<>