Q71

Given a set of distinct integers, S, return all possible subsets.
Q72

Given a sorted array of integers, find the starting and ending position
of a given target value.
Your algorithm's runtime complexity must be in the order of O(log
n).(Binary search)