##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Given a sorted array of integers and a target, find the starting and ending position of the target. If the target is not found, return [-1, -1].
You must write an algorithm with runtime.
Example: For [5,7,7,8,8,10] and target , return [3, 4]. You need both lower bound and upper bound.
