private static void binarySearchLast(int[] a, int i) {
		// TODO Auto-generated method stub
		
int start = 0;
		
		int mid = 0 ;
		
		int end = a.length;
		
		while(start<end){
			mid = 	((start + end)/2);
			System.out.println(mid);
			if (a[mid] == i){
				start = mid;
			}
			else if(a[mid] < i){
				start = mid + 1;
			}
			else if(a[mid] > i)
				end = mid -1 ;
			if (start==end){
				mid = start;
			}
			System.out.println("Start  " + start);
			System.out.println("end  " +end);
		}
		if(a.length > mid && a[mid] == i){
			System.out.println("find  "  +  mid);
			return ;
		}
		else{
			System.out.println("Not Found");
		}
		
	}