Asymmetric Swaps

Chef has two arrays $A$ and $B$ of the same size $N$. In one operation, Chef can: - Choose two integers $i$ and $j$ $(1 \leq i, j \leq N)$ and swap the elements $A_i$ and $B_j$. Chef came up with a task to find the **minimum** possible value of **($A_{max} - A_{min}$)** after performing the swap operation any (possibly zero) number of times. Since Chef is busy, can you help him solve this task