Given two sorted lists L$1$ and L$2,$ write a Java program to generate a third list which contains all nodes of L$1$ and L$2$ in sorted order. $($i$.$e$.,$ the third list is sorted too$).$ Same values in lists should be retrieved only once i$.$e$.,$ union set of lists should be created $($You can assume that the lists contain only integer values$).$