Find the union of differences of two sets of numbers (A – B) U (B – A). Your algorithm's time complexity should be 0(n log n) or better. If your algorthm's time complexity is worse than O(n log n),...

dont copy from existing one answer only u r sure else skip

Extracted text: Find the union of differences of two sets of numbers (A – B) U (B – A). Your algorithm's time complexity should be 0(n log n) or better. If your algorthm's time complexity is worse than O(n log n), you will receive half of the points at most. Prove your algorithm's time complexity. Algorithm FindUnion0f Diff(A[0 ... n – 1], B[0..m – 1]) // Input: Arrays A[1..n] and B[1..n] whose elements are unique ( A and B are sets). // Array A and array B are appeneded and assigned to array C.The index i is used for array C, //Output: Array R What is the time complexity of the algorithm for the worst case?