Given an array of N = 10, 000 integers, how many comparisons or checks does the binary search algorithm need to perform to determine if an arbitrary integer k is in the array or not? Give the number of comparisons as a whole number using the ceiling operator.

*Please provide the Pseudocode also