if you are conducting a binary search through a tree that holds student objects, and you are trying to find out whether a student with a certain id exists in the data set, what must be true in order for this search to be able to be performed in o(log n) time? group of answer choices a. the tree must be balanced the tree must be a binary search tree (ie. data stored in order) b. the student class must implement comparable using student name to sort students. c. the tree must be complete d. the tree must be full the student class must implement e. the comparable interface, using id as the field for sorting students.