Problem: Minimum Cost to Make Two Binary Strings Equal

Try to solve the Minimum Cost to Make Two Binary Strings Equal problem.

Statement

You are given two binary strings s and t of length n, along with three integers flipCost, swapCost, and crossCost.

You can perform the following operations any number of times in any order:

Flip: Choose any character in s or t and flip it from '0' to '1' or from '1' to '0'. This operation costs flipCost.
Swap: Choose any two adjacent characters in s or in t and swap them. This operation costs swapCost.
Cross Swap: Choose an index i such that $0 \leq i < n$ , and swap s[i] with t[i]. This operation costs crossCost.

Return the minimum total cost required to make s equal to t.

Constraints:

Try to solve the Minimum Cost to Make Two Binary Strings Equal problem.

You are given two binary strings s and t of length n, along with three integers flipCost, swapCost, and crossCost.

You can perform the following operations any number of times in any order:

Flip: Choose any character in s or t and flip it from '0' to '1' or from '1' to '0'. This operation costs flipCost.
Swap: Choose any two adjacent characters in s or in t and swap them. This operation costs swapCost.
Cross Swap: Choose an index i such that $0 \leq i < n$ , and swap s[i] with t[i]. This operation costs crossCost.

Return the minimum total cost required to make s equal to t.

Constraints: