Union of Sorted Arrays (No Duplicates)
Goal: Combine all unique elements from both arrays
• Compare A[i] and B[j], add smaller to union
• Skip if same as last added (avoid duplicates)
• Handle remaining elements from non-exhausted array
Time: O(n + m)