Can you help me solve the java problems?

All BSTs have a O(logN) search time O True O False Which best describes a scenario where we want to process items using a Stack data structure? O A line of people waiting at the bank, where new customers are added to the end. The cashier then helps customers in order of their arrival. O A pile of dishes, where dirty dishes are are added to the top. We then work our way down, washing dishes one by one from top to bottom. A row of books on a shelf where we can only fit a limited number of books on the shelf. We can grab the books in any order we want. O A large database of millions of phone numbers where we want to find a number quickly. We can add and remove as many new phone entries easily as we want while maintaining order