Write a program in pseudocode to solve this problem in time O(n). The input is two sorted lists of n distinct integers each. The output is a list of the integers in the intersection of the two lists, in sorted order. For example, if n 5 and the two input lists are 1 3 579 and 2 3 4 5 7, then the output should be 3 5 7. 3