You are given two sorted lists, A and B. The operation intersection (A, B) will compute (construct and return) An B (the intersection of A and B: only those elements which are in both sets). For example, if A = [0, 2, 4, 6, 8, 10, 12] and B = [0, 3, 6, 9, 12, 15), the list [0, 6, 12 is returned. A. Write the procedure intersection (A, B). B. You may use only the public STL sequence container operations (see containers library documentation e). Don't overthink the problem (don't look for hacky solutions), just think about simple list operations (e.g. capacity, access, insert, remove). C. What is the running time of your procedure