Given two strings, you have to find and print the longest common subsequence between them.Input: T Test case T no of input string will be given to you. E.g. 3 abcd abxy sghk rfgh svd vjhfd Constrain 1≤ length (string1) ≤100 1≤ length (string2) ≤100 Output: Print the ...