Binary search involves searching a sorted list
The number of values that will be examined is 15
<h3>How to determine the number of examined values</h3>
The equation that calculates the number of values that will be examined is:

Where n represents the number of values to examine and N represents the number of time stamps
So, we have:

Take the log of both sides

Apply the laws of logarithm
![[n - 1]\log(2) = 4](https://tex.z-dn.net/?f=%5Bn%20-%201%5D%5Clog%282%29%20%3D%204)
Divide both sides y log(2)

The next integer greater than 13.2 is 14.
So, we have:

Add 1 to both sides

Hence, the number of values that will be examined is 15
Read more about binary search at:
brainly.com/question/20411780
The design of the software is covered by copy right unless it is open sourced or is a very common interface. They would need to come up with their own design and way of solving the problem to have a solution that was not copyrighted.
Commenting. When someone comments of a blog the blog's writer can comment back, to answer questions, etc.