Consider the following algorithms (all of which perform the same task) and their associated statement counts:
1. Algorithm 1, Fn = 500n - 2
2. Algorithm 2, Gn = 30n ln n + 5
3. Algorithm 3, Hn = 2^n + 7
4. Algorithm 4, Kn = 250∙∙∙∙∙n + 11
Here, n denotes the size of the input. Which of the following statements is/are true?
Algorithm 1 is more efficient than Algorithm 2 for large input sizes
Algorithm 2 is more efficient than Algorithm 1 for small input sizes
Algorithm 2 is more efficient than Algorithm 3 for large input sizes
Algorithm 3 is more efficient than Algorithm 2 for large input sizes
Algorithm 4 is more efficient than Algorithm 2 for large input sizes
Algorithm 1 is more efficient than Algorithm 4 for small input sizes.