int go(long n) {
if (n <= 1) return 0;
if (n & 1) {
return 1 + min(go(n - 1), go(n + 1));
}
else {
return 1 + go(n / 2);
}
}```
Can anyone please tell me time complexity of above function. Thanks