In the definition of Big-o, why is the “for N >J no” needed? 2. If f 1 (N) 2N and f2 (N) 3N, why are they both o (N), since 3N is larger than 2N for N> 12 3. If a function is known to be o (N), what would you expect to happen to the running time if the input size is doubled? What if the function was o (N*N) Explain your answer Show transcribed image text In the definition of Big-o, why is the “for N >J no” needed? 2. If f 1 (N) 2N and f2 (N) 3N, why are they both o (N), since 3N is larger than 2N for N> 12 3. If a function is known to be o (N), what would you expect to happen to the running time if the input size is doubled? What if the function was o (N*N) Explain your answer