For this Question: Given two strings S1 and S2, find the length of the smallest string which has both, S1 and S2 as its sub-sequences.

Note: S1 and S2 can have both uppercase and lowercase letters.The first line of input contains an integer T, denoting the number of test cases. Each test case contains two space separated strings.

Constraints:
1 <= T <= 100
1<= |S1|, |S2| <= 100For each testcase, in a new line, output the length of the required string.Input:
1
AGGTAB GXTXAYB

Output
9

Explanation:
Testcase 1: “AGXGTXAYB” contains both the strings as subsequence., I have written this Solution Code: def superSeq(X, Y, m, n): 
    dp = [[0] * (n + 2) for i in range(m + 2)] 
  
    for i in range(m + 1): 
        for j in range(n + 1): 
             
            if (not i): dp[i][j] = j 
            elif (not j): dp[i][j] = i 
              
            elif (X[i - 1] == Y[j - 1]):  
                 dp[i][j] = 1 + dp[i - 1][j - 1] 
                   
            else: dp[i][j] = 1 + min(dp[i - 1][j],  
                                     dp[i][j - 1]) 
             
    return dp[m][n] 
t=int(input())
for l in range(0,t):
	st=input().split()
	st1=st[0]
	st2=st[1]
	print (superSeq(st1,st2,len(st1),len(st2))), In this Programming Language: Python, Now tell me if this Code is compilable or not?