3927. Minimize Array Sum Using Divisible Replacements

You are given an integer array nums. You can perform the following operation any number of times: - Choose two indices a and b such that nums[a] % nums[b] == 0. - Replace nums[a] with nums[b]. Return the minimum possible sum of the array after performing any number of operations. Example 1: Input: nums = [3,6,2] Output: 7 Explanation: - Choose a = 1, b = 2, where nums[a] = 6 and nums[b]