Given two lists of integers of sizes m and n respectively, describe an algorithm that runs in time O(m+n) that computes the intersection of the lists. Argue that your algorithm is correct, and has the desired running time.