How to find Big O of a diving recursive function

Question

I am learning Big O and am stuck on a problem.

Problem -

int sample_function (int x) {
 if (x<1){
   return x;}
  
 int y = x/2; 
 return sample_fun