plz i went every answer with explain!!! why !!

1. The big-O complexity of a nested array is 2. The best-case complexity of binary search is a. O(n) b. O(log n) c. 0 (n) d. O (1) 3. The polynomial big-O complexity is mathematically represented by 4. The worst-case complexity of linear search is 5. In changing money, greedy choice is not always optimal. True False 6. To estimate the time when a professor enters the classroom can be done using the order notation 7. The limiting behavior of a function when the argument tends towards infinity is called 8. The problem with recursive change algorithm is that