You are given an integer array nums and two integers cost1 and cost2.

You can perform two types of operations on the array any number of times:

• Choose an index i and increase nums[i] by $1$ with a cost of cost1.

• Choose two distinct indices i and j and increase both nums[i] and nums[j] by $1$ with a cost of cost2.

Return the minimum cost to make all elements of nums equal. Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^6$

• $1 \leq$ cost1 $\leq 10^6$

• $1 \leq$ cost2 $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.