Minimum Number of Steps to Make Two Strings Anagram II

Given two strings, s and t, the task is to determine and print the minimum number of steps required to make s and t anagrams of each other.

In each step, you can append any character to either s or t.

An anagram of a string is a string that contains the same characters with possibly different orderings.

The objective is to find and print the minimum number of steps needed to transform s and t into anagrams of each other.