CS242-Data Structures-Ch5 Algorithm Lab Algorithm running times grow at different rates Bob is writing a search algorithm for NASA. His algorithm will kick in when a rocket is about to land on the Moon, and it will help calculate where to land. This is an example of how the run time of two algorithms can grow at differ trying to decide between simple and correct. On one hand, binary search is faster. And Bob has only 10 seconds to figure out where to land-otherwise, the rocket will be off course. On the other hand, simple search is easier to write, and there is less chance of bugs being introduced. And Bob really doesn't want bugs in the code to land a rocket! To be extra careful, Bob decides to time both algorithms with a list of 100 elements. ent rates. Bob is search and binary search. The algorithm needs to be both fast