public int[] searchRange(int[] A, int target) {
		// if(A.length==0);
		int[] result = new int[2];
		result[0] = -1;
		result[1] = -1;
		if (A.length == 0)
			return result;
		int index = find_index(A, 0, A.length - 1, target);
		result[0] = index;
		result[1] = index;
		System.out.println("Index " + index);
		if (index == -1)
			return result;
		int left = index - 1;
		int right = index + 1;
		boolean left_flag = false;
		boolean right_flag = false;
		while (left >= 0 && A[left] == target) {
			left_flag = true;
			left--;
		}
		while (right < A.length && A[right] == target) {
			right_flag = true;
			right++;
		}
		if (left_flag == true)
			result[0] = ++left;
		if (right_flag == true)
			result[1] = --right;

		return result;
	}