In this assignment, we want to simulate the merging process by using the FIFO queue data structure, including both the array-based and the singly linked list-based implementations.

Your program should be named as: Merge.java

2. The input and output of your program. The input are a number of files, each of which contains a sequence of integers, one integer per line, in ascending order. Your program should be working for any number ( 2) of input files. The number of command line parameters is available as args.length. The output is the screen print of the sorted (in ascending order) entire data set obtained from merging all the integers in the input files.

Suppose we supply to your program with three files named data1.txt, data2.txt, and data3.txt,

Then, the command line you should type would be: $java Merge data1.txt data2.txt data3.txt