(IN JAVA) Run the following program to find the output   public class FinalProgramTwo { public static void main(String args[]) { int n; Scanner sc =new Scanner(System.in); System.out.println("Enter the Size of 1st array:"); n=sc.nextInt();// size of 1st array String a[] = new String[n]; System.out.println("Enter the element of 1st array:"); for(int i=0;i remove_dublicate = new LinkedHashSet(Arrays.asList(c)); // converting array to list String[] newArray = remove_dublicate.toArray(new String[ remove_dublicate.size() ]); // converting list to array return newArray; } }

(IN JAVA)

Run the following program to find the output

public class FinalProgramTwo {
public static void main(String args[]) {
int n;
Scanner sc =new Scanner(System.in);
System.out.println("Enter the Size of 1st array:");
n=sc.nextInt();// size of 1st array
String a[] = new String[n];
System.out.println("Enter the element of 1st array:");

for(int i=0;i<n;i++){
a[i]=sc.next();
}
System.out.println("Enter the size of 2nd array");
int m =sc.nextInt(); // size of 2nd array
System.out.println("Enter the element of 2nd array:");

String b[] = new String[m];
for(int i=0;i<m;i++){
b[i]=sc.next();
}




String d[] = new String[m+n];
d= mergeUniqueValues(a,b);
int size =m+n;

for( int i=0;i<d.length;i++){
System.out.println(d[i]);
}
}

private static String[] mergeUniqueValues(String[] a, String[] b) {

int size=a.length+b.length;
String c[] = new String[size];

int i;
int j;
int pos=0;
for(i=0;i<a.length;i++){
c[pos++]=a[i];


}
for( j=0;j<b.length;j++){
c[pos++]=b[j];


}
Arrays.sort(c);
LinkedHashSet<String> remove_dublicate =
new LinkedHashSet<String>(Arrays.asList(c)); // converting array to list
String[] newArray = remove_dublicate.toArray(new String[ remove_dublicate.size() ]); // converting list to array
return newArray;
}
}