Lower and upper bound binary search

Given an array sorted in non-decreasing order and a target, return the first index whose value is at least the target and the first index whose value is greater than the target. Use them to count the copies of the target, and be careful with the loop bounds.