Search for a Range (First and Last Position)

Given a sorted array of integers `nums` and a target value, find the starting and ending position of the target. Your algorithm's runtime complexity should be $O(\log n)$. Use two Binary Searches.