A program takes 35 seconds for input size 20 (i.e., n=20). Ignoring the effect of constants, approximately how much time can the same program be expected to take if the input size is increased to 100 given the following run-time complexities?

1. O(N)

2. O(N + log N)

3. O(N^3)

4. O(2^N)^[1]