Using Master Theorem, what is the solution of recurrence relation $T(n)=T(\frac{n}{2})+1?$

$T(n)=(1)$

$T(n)=(logn)$

$T(n)=(n)$

$T(n)=(n^{{?}^{{?}^{?}}}2)$