Java : Given two unsorted arrays ,write a program to remove duplicates and merge it into sorted order

package com.qahumor;

import java.util.Iterator;
import java.util.TreeSet;

/*@author : qahumor 
 * Given two Unsorted Arrays a1 and a2, 
 * Remove duplicates and merged both into sorted order  
 * 
 */

public class TwoUnsortedArrayMergedAndSorted {

 public static void main(String[] args) {
  
  int[] a1 = {1,2,3,49,6,77,8};
  int[] a2 = {3,67,77,3,10,54};
  int[] a3;
  
  TreeSet<Integer> ts = new TreeSet<Integer>();

  for(int i = 0 ; i < a1.length;i++){
   ts.add(a1[i]);
  }
  
  for(int j = 0 ; j < a2.length ; j++){
   ts.add(a2[j]);
  }
  
  Iterator<Integer> it = ts.iterator();
  a3 = new int[ts.size()];
  int k =0;
  while(it.hasNext()){
   a3[k] = it.next();
   k++;
  }
  
  
  for(int p = 0 ; p < a3.length ; p++){
   System.out.print(a3[p]+",");
  }
 }

}