1.Write a code in java for merge sort that does not use recursive calls to any functions. Instead, it just uses loops.

2.The input for the program comes from a text file called input.txt and the output will be written to output.txt.

3. The input.txt will contain several lines of numbers where each line will have integers separated by spaces as unsorted lists. Each line must be sorted separately by your algorithm. So the algorithm is called repeatedly (not recursively) for each line in the input.txt. Use Scanner inFile = new Scanner(new FileReader("input.txt"));.