Consider the longest common subsequence problem between sequence A[1..m] and sequence B[1..n]. Give a recursive algorithm to print out ALL the longest common subsequences assuming that you already build the table T[1..m, 1..n] where the entry T[j, k] represents the length of the longest common subsequence between A[1..j] and B[1..k].