Hello, I had a few questions and I always get confused w.r.t. the following points when solving something related to binary search. Some of them might seem to be silly but please help.

1. when recursively callnig should low = mid+1 OR mid
   Similarlly should high = mid-1 OR mid
2. low should start from 0 or 1
3. At the end, should we return high/low when answer is not in the mid index or it depends on the problem