(C) What is the time complexity?

2. Given two sorted lists, Li and L2, complete a following procedure in Java to compute: heolext , and compareToj) and one ioo2. ) using only the basic list operators (nexto. hasNext), and compareTo()) and one loop. public static > void difference(List L1, List iterL1 = L1.listlterator(); ListlteratorAnyType > iterL2 L2.listlterator(); if (iterl1.hasNext() && iterL2.hasNext )) item1 = iterL1.next(); itemL2 iterl2.next); II YOUR CODE GOES HERE (b) L1 L2 = { x 1 x e L1 and x e 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.1istlterator(); ListlteratorAnyType> iterL2 2.listlterator(); if (iterL1.hasNext () && iterL2.hasNext)) iteml1 iterL1.next); itemL2 = iterL2.next(); II YOUR CODE GOES HERE