Given an integer array nums, an integer k, and an integer multiplier:

• Perform k operations on nums.

• In each operation:

  • Find the minimum element x in nums (if there are multiple occurrences of the minimum value, choose the first occurrence).

  • Replace x with x * multiplier.

Return the final state of nums after all k operations.

Constraints:

• $1 <=$ nums.length $<= 100$

• $1 <=$ nums[i] ...