C++ *PLEASE INCLUDE SCREENSHOTS OF YOUR CODE WORKING*

Write the code for the function getIntersection below, that given two sorted linked lists returns a linked list that is an intersection of them. Assume that these linked lists are implemented by the class IntList with the interface from Problem 2.

IntList& getIntersection(IntList& intList1, IntList& intList2) {

// TODO: you code here

}

Estimate the big-O complexity of your implementation.