Which of the following statements are true about a binary search? Select all statements that are true. Each iteration of the algorithm cuts the search space in half. It requires a sorted list. It works with both arrays and linked lists. It only works well for large lists (e.g., greater than 100 items)