(Algorithms)Suppose you are given two n-element sorted sequences A and B, each representing a set (none has duplicate entries). Describe an O(n)-time method(Pseudocode) for computing a sequence representing the set A\B (with no duplicates; note: the difference of sets A and B consists of those elements in A and not in B). You do not have to argue correctness (but, obviously, your method must be correct) but must justify the running time.