Given two sorted lists, L1 and L2, complete a following procedure in Java to compute:

(a) L1 \ L2 = { x | x ? L1 and x ? L2 } using only the basic list operators (next(), hasNext(), and compareTo()) and one loop.

public static >

void difference(List L1, List L2, List Difference)

{

ListIterator iterL1 = L1.listIterator();

ListIterator iterL2 = L2.listIterator();

if ( iterL1.hasNext() && iterL2.hasNext() )

{

itemL1 = iterL1.next();

itemL2 = iterL2.next();

}

// YOUR CODE GOES HERE

(b) L1 ? L2 = { x | x ? L1 and x ? L2 } using only the basic list operators (next(), hasNext(), and compareTo()) and one loop.

public static >

void intersection(List L1, List L2, List Intersect)

{

ListIterator iterL1 = L1.listIterator();

ListIterator iterL2 = L2.listIterator();

if ( iterL1.hasNext() && iterL2.hasNext() )

{

itemL1 = iterL1.next();

itemL2 = iterL2.next();

}

// YOUR CODE GOES HERE