title: Find all common subsequences of given two strings
body: <p>I have tried using the LCS(Longest Common Subsequence) algorithm, but I want subsequences of all lengths. How do we modify the LCS Code?</p>
  
  <p><strong>Example</strong>: Given <code>String_1="abxcd"</code> and <code>String_2="aybcd"</code> LCS results in <code>"abcd"</code> but I would like to display { "a", "ab", "bcd", "cd", "abcd", "d" }</p>