Ihave an algorithm that runs in o(n ), where n is the size of the problem. for n = 100, the time for the algorithm to run is 1 minute. how long does the algorithm take for n=1000? a) same time b) 10 minutes c) 100 minutes d) 1000 minutes

Iread this book last year so take this with a grain of salt.gene jumps from the tree to compete with finny due to the fact that gene is always trying to do better than finny. he is put under the grasp of peer pressure due to finny almost forcing him to do this. ever since he first jumped finny kept pressuring him to jump since he thought gene enjoyed jumping.rather than uses this answer you should probably just reread chapters 3-4