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

Arunner is jogging at a steady 3.6 km/hr. when the runner is 2.9 km from the finish line, a bird begins flying from the runner to the finish line at 14.4 km/hr (4 times as fast as the runner). when the bird reaches the finish line, it turns around and flies back to the runner. even though the bird is a dodo, we will assume that it occupies only one point in space, i.e., a zero-length bird. how far does the bird travel? (b) after this first encounter, the bird then turns around and flies from the runner back to the finish line, turns around again and flies back to the runner. the bird repeats the back and forth trips until the runner reaches the finish line. how far does the bird travel from the beginning? (i.e. include the distance traveled to the first encounter)