The recurrence relation that arises in relation with the complexity of binary search is

A

$$T(n) =2T(\frac{n}{2})+k$$, where k is constant

B

$$T(n) =T(\frac{n}{2})+k$$, where k is constant

C

$$T(n) =T(\frac{n}{2})+log n$$, where k is constant

D

$$T(n) =T(\frac{n}{2})+n$$, where k is constant