Write a program in Java to help out Thor. The input is taken from a text file. This file contains three lines. The first line contains n, the common length of the two lists. The second line contains the integers from L1, separated by single spaces. Similarly, the third line contains the integers from L2. No list contains duplicates. The output should be sent to a text file. This file should contain a line containing all the integers from L2, arranged with respect to L1. For more details, refer to the code outlines provided with this homework.