Given two strings, s and t, find the minimum window substring in s, which has the following properties:

1. It is the shortest substring of s that includes all of the characters present in t.

2. It must contain at least the same frequency of each character as in t.

3. The order of the characters does not matter here.

Note: If there are multiple valid minimum window substrings, return any one of them.

Constraints:

• Strings s and t consist of uppercase and lowercase English characters.

• 1 $\leq$ s.length, t.length $\leq 10^3$