The time complexity of the algorithm whose recurrence relation is:

T$($n$)=$ T$($sqrtn$)+3$

Group of answer choices $1)$ T$($n$)=$ O$($log$^2)$ n $2)$ T$($n$)=$ O$($n lgn$)3)$ T$($n$)=$ O$($lg lg n$)4)$ T$($n$)=$ O$($logn$)$