Anagram Difference Problem Statement

Given two strings, 'STR1' and 'STR2', of equal lengths, determine the minimum number of manipulations required to make the two strings anagrams of each other.

Input:

The first line contains an integer 'T', denoting the number of test cases. 
The first line of each test case contains the string 'STR1' consisting of lowercase English alphabets. 
The second line of each test case contains the string 'STR2' consisting of lowercase English alphabets.

Output:

For each test case, output an integer representing the minimum number of manipulations required to make 'STR1' and 'STR2' anagrams.

Example:

Input: 
T = 2 
STR1 = "eat", STR2 = "ate" 
STR1 = "buy", STR2 = "bye"

Output: 
0 
2

Constraints:

• 1 <= T <= 100
• 1 <= N <= 5*10³ (where 'N' is the length of the strings 'STR1' and 'STR2').
• Time limit: 1 second

Note:

In this context, an anagram of a string is another string with the same quantity of each character in it, arranged in any order.