Answer:
There is also an attachment below
Explanation:
Since we are talking about binary search, let's assume that the items are sorted according to some criteria.
Time complexity of binary search is O(logN) in worst case, best case and average case as well. That means it can search for an item in Log N time where N is size of the input. Here problem talks about the item not getting found. So, this is a worst case scenario. Even in this case, binary search runs in O(logN) time.
N = 700000000.
So, number of comparisions can be log(N) = 29.3 = 29.
So, in the worst case it does comparisions 29 times
E-mail B is the more appropriate workplace e-mail because it’s straightforward, polite, and professional. E-mail A was more accusatory and aggressive, and many people don’t like when they’re being yelled at or accused of something and, as a result, this person may start to dislike that coworker. However, the second e-mail was more polite and made the receiver think of them as a respectful person so that they’re happy to help them out.
read that hope this helped