Use the divide and conquer strategy to understand the binary search for a sorted list of n elements. Let T(n) denote the time complexity function for the binary search. Derive a recurrence relation...

Use the divide and conquer strategy to understand the binary search for a sorted list of n elements. Let T(n) denote the time complexity function for the binary search. Derive a recurrence relation for T(n) and solve for T(n) to get a close form expression.