Least Deletions on Strings

You are given 2 strings, $S1$ and $S2$.\ Find the minimum number of deletions needed to be performed on $S1$ or $S2$, as to make them a same string. Assume everything is in lowercase. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of 2 lines of input, $S1$ and $S2$. ### Output For each test case, output on a ne