Please code this in Java.

Given two sorted lists, L1 and L2, complete a following procedure in Java to compute: (a) L1 \ L2 = { x | x e L1 and x f L2 } using only the basic list operators (next(), hasNext(), and compareTo)) and one loop public static > void difference(List L2, List iterL! = L1.11st1terator(); ListIteratorAnyType> 1terL2 L2.11stIterator(); if iterL1.hasNext) &s iterL2.hasNexto) iten?! itemL2 iterL1.next(); iterL2.next(); /I YOUR CODE GOES HERE (b) L1 L2 = { x | x e L1 and x e L2) using only the basic list operators (next(), hasNext(), and compareTo)) and one loop public static AnyType extends comparable? super AnyType>> void intersection(List L1, List iterL1-L1.1istIterator) if iterL1.hasNext) &s iterL2.hasNexto) item?? itemL2 iterL1.next(); iterL2.next(); /I YOUR CODE GOES HERE Given two sorted lists, L1 and L2, complete a following procedure in Java to compute: (a) L1 \ L2 = { x | x e L1 and x f L2 } using only the basic list operators (next(), hasNext(), and compareTo)) and one loop public static > void difference(List L2, List iterL! = L1.11st1terator(); ListIteratorAnyType> 1terL2 L2.11stIterator(); if iterL1.hasNext) &s iterL2.hasNexto) iten?! itemL2 iterL1.next(); iterL2.next(); /I YOUR CODE GOES HERE (b) L1 L2 = { x | x e L1 and x e L2) using only the basic list operators (next(), hasNext(), and compareTo)) and one loop public static AnyType extends comparable? super AnyType>> void intersection(List L1, List iterL1-L1.1istIterator) if iterL1.hasNext) &s iterL2.hasNexto) item?? itemL2 iterL1.next(); iterL2.next(); /I YOUR CODE GOES HERE