I am at a loss on how to get the correct answer to this question. How many comparisons are needed for a binary search in a set of 64 elements? I know the formula f(n) = f(n/2) + 2 I know the correct answer which is 14. No matter what I do I cannot come up with this answer. Please help me by showing a couple of steps and I can break down this wall!