What is LCS of X and Y ? Explain how you can obtain the LCS from the table and show the table

Let X and Y be two strings such that X= "recursion" and Y= "election" We define Xi and Yj as two prefixes of X and Y of length i and j, respectively. We use a matrix C to store the optimal solutions of the subproblems. Let C/i,j/ be the length of Longest Common Subsequence (LCS) of Xi and Yi