We would say that Binary Search: a. Runs in O(lg(n)) time because it will cut the list size in half for each iteration. b. Runs in O(n2 ) time, because for each element in the list we have to scan the rest of the list to ensure there are no duplicates. c. Runs in O(n) time since it has to scan the entire list. n is the length of the list, so it is the total runtime.

Stops: using the information learned in this course, explain three things you will not do when driving. a. b. c. explain why you will not do these things when driving. starts: using the information learned in this course, explain three things you will do when driving. a. b. c. explain why you will do these particular things when driving. explain one thing you will stop doing as a passenger. explain one thing you will start doing as a passenger.