Please provide step by step solution, Thank You

Let A[1..n] and B[1..n] be two arrays sorted in increasing order. Assume that both A and B have no duplicate elements. Write the pseudocode of an algorithm which computes an array C. where C is the symmetric difference C = A B. The running time of the algorithm must be O(n). The elements in C must be sorted in increasing order. Upload a file with your solution. * The symmetric difference is defined as A B = (A - B) Union (B - A) For example, if A = and B = , then C =