Maximise Adjacent Sum

You are given an array $A$ of size $N$ $(N \ge 2)$. We define $f(A) = \sum_{i = 1}^{N - 1} (A_i + A_{i + 1})$. Find the **maximum** value of $f(A)$ you can obtain by rearranging the elements of $A$ in any arbitrary order. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of multiple lines of input. - The first