Using the same iterative approach as that used to merge two sorted lists, complete/fix the implementation of the following function named intersection () for computing the intersection between two given ascending order sorted sequences, seq_a and seq_b such that the worst case performance of the function is O(n). You should not just consider adding new code. The code provided to you below may even have mistakes in it that you can eliminate by removing code. So do not feel limited to only adding code on top of what you have been provided in the code cell below. Do whatever you must to complete and/or fix this code! . Do not remove the directive file intersection.py from the top of the following cell. Do not use recursion. You must use loopingliteration to solve this problem. . Do not import any external modules. . Start by cleaning out the extra comments and pass statements YOU MUST WRITE YOUR ANSWER IN THE FOLLOWING MARKDOWN CELL []: file intersection.py def intersection ( seq_a, seq_b): Returns the elements that are common in the given two lists a b = 1 # YOUR CODE HERE raise Not ImplementedError() while a