Problem : Search Insert Position O (Log n) | Binary Search Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. [1,3,5,6] 5 Output: 2 [1,3,5,6] 2 Output…