We have five algorithms that run in O(log n), O(n), O(n), O(n), and O(2), respectively. The running times of each algorithm, for n-100 are as follows: . O(log n) -1us .O(n) 1 ms .O(n)- 10 ms 2. O(n)-1 s 0(2)-3600 s How long would it take to run for each of the algorithms if n 10,000? 3. We have five algorithms that run in O(log n), O(n), O(m), O(n), and 0(2), respectively. We discovered that the largest problem (that is, the largest value of n) that each algorithm could finish in 10 ms was as follows: . O(log n) -n- 10,000 0(n)-n= 10,000 .O(n)-n-5,000 .O(n)-n-1,000 0(2) -n-30 Approximately, what is the largest problem that each of the algorithms can solve in 1 second