Question 1: For each question hereafter, give the only correct response. (1 mark) To say that a program X has a better time complexity than a program Y means: (A) X will be slower than Y for all possible inputs. (B) X will be faster than Y for all possible inputs. (C) X will be faster than Y except perhaps for small and large inputs. (D) X will be faster than Y for all inputs except perhaps small inputs. (E) X will be faster than Y for all inputs except perhaps large inputs. When searching a sorted array of 800 elements with Binary Search, how many elements need to be examined at most? (A) 8. (B) 9. (C) 10. (D) 11. (E) 800