You are given two strings, A and B. Answer, what is the smallest number of operations you need to
transform A to B?
Operations are:
T - number of test cases
For each test case:
Both strings will contain only uppercase characters and they won't be longer than 2000 characters.
There will be 10 test cases in data set.
For each test case, one line, minimum number of operations.
Input: 1 FOOD MONEY Output: 4