Please show the entire code with a preview of the output.

Given two sorted lists, L1 and L2, complete a following procedure in Java to compute: (a) L1L2 = { x | x e L1 and x L2 } using only the basic list operators (next(), hasNext(), and compareTo)) and one loop. public static AnyType extends Comparable? super AnyType>> void difference (List L1, List L2, List Difference) LstIteratorAnyType> iterL1 L1.1istlterator(); List IteratorAnyType> iterL2 = L2.listlterator(); if ( iterL1.hasNext() && iterL2.hasNext) item1 itemL iterL1.next(); 2 = iterL2.next(); = // YOUR CODE GOES HERE