Minimum Operations Problem Statement

You are given an array 'ARR' of size 'N' consisting of positive integers. Your task is to determine the minimum number of operations required to make all elements in the array equal. An operation can be either addition, subtraction, multiplication, or division performed on any element in the array.

Input:

The first line contains a single integer 'T', the number of test cases.
The first line of each test case contains an integer 'N', the length of the array.
The second line of each test case consists of 'N' space-separated integers representing the array 'ARR'.

Output:

For each test case, output an integer on a new line, depicting the minimum number of operations needed to make all elements of the array equal.

Example:

Input:
T = 1
N = 3
ARR = [1,2,3]

Output:

2

Explanation:

One possible way to achieve equal elements is by incrementing the element with value 1 by 1 and decrementing the element with value 3 by 1, resulting in the array [2,2,2]. This requires 2 operations.

Constraints:

• 1 <= T <= 10
• 1 <= N <= 105
• 0 <= ARR[i] <= 105
• Time Limit: 1 sec