**Compilation/Execution Result:**

Given two strings in lowercase, the task is to make them anagram. The only allowed operation is to remove a character from any string. Find minimum number of characters to be deleted to make both the strings anagram. If two strings contains same data set in any order then strings are called **Anagrams**.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of 2 strings to make the anagrams.

**Output:**

Output the minimum number of characters to be deleted to make both the strings anagram.

**Constraints:**

1<=T<=10^5

1<=length of string<=10^5

**Example:
Input:**

2

bcadeh

hea

cddgk

gcd

3

2

Author: Ayush Govil 1

rksingh | 74 |

iharshitmittal | 74 |

sj5331 | 69 |

Himanshusinghchauhan | 63 |

Cqwert | 63 |

Shashank_Pathak | 636 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 359 |

rksingh | 358 |

akhayrutdinov | 4159 |

sanjay05 | 3611 |

Quandray | 2819 |

Ibrahim Nash | 2497 |

Michael Riegger | 2294 |