public int [] usingHashing(int [] arrA, int [] arrB){
		//Insert all the elements of arrA in hash Table,
		//Element as key and its count as its value
		//Navigate through arrB, check element's presence in Hash table
		//if it is present then takes its value (count) and insert into arrA.
		//Once arrB is completed, take rest of the elements from Hash table
		// Sort Them and insert into arrB.
		int resIndex = -1;
		Hashtable<Integer, Integer> h = new Hashtable<>();
		for(int i=0;i<arrA.length;i++){
			if(h.containsKey(arrA[i])){
				int count = h.get(arrA[i]);
				count++;
				h.put(arrA[i], count);
			}else{
				h.put(arrA[i], 1);
			}
		}
		for(int i=0;i<arrB.length;i++){
			if(h.containsKey(arrB[i])){
				int count  = h.get(arrB[i]);
				while(count>0){
					arrA[++resIndex] = arrB[i];
					count--;
				}
				h.remove(arrB[i]);
			}
		}		
		ArrayList<Integer> al = new ArrayList<Integer>();
		Set<Integer> keys = h.keySet();
		for(Integer x:keys){
			al.add(x);
		}
		Collections.sort(al);
		Iterator<Integer> it = al.iterator();
		while(it.hasNext()){
			arrA[++resIndex] = it.next();					
		}
		return arrA;
	}