Given an array of integers nums sorted in ascending order, find the starting and ending position of a given targetvalue.Your algorithm's runtime complexity must be in the order of O(log n). If the target is not found in the array, return [-1, -1]. Ex
<script> var array = new Array(1,2,5,1,4,4,2,3,5,1,1,5,5,5,6,7,3,9,9,10); var arr = new Array(); var test = new Array(); var num = 1; var temp = ""; var size = array.length; for(var i=0;i<size; i++){ for(var j=i+1;j<size; j++){ if(ar