<T> {
* Returns the current number of elements in the list * @return Currentnumber of elements in the list public int size();
* Inserts an element atstartingfrom
* log base2 N)
while(list1 is not at the end of the list) {if(the currentelement in list1 is not in list2) // Binary Search -> O(log base2 N)
addthe currentelement</