Minimum Replacements to Sort the Array

You're provided with a 0-indexed integer array, nums. In one operation, you can replace any element of the array with any two elements that sum to it.

For example, if nums = [5,6,7], in one operation, you can replace nums[1] with 2 and 4, resulting in nums becoming [5,2,4,7].

Your task is to determine and print the minimum number of operations required to make the array sorted in non-decreasing order.