Yоu аre given twо strings X аnd Y оf lengths m аnd n, respectively. The function L(i, j) represents the length of the longest common subsequence of the first i characters of X and the first j characters of Y. Which of the following represents the correct recurrence relation for L(i, j)? Example 1: Input: X = "abcde", Y = "ace" Output: 3 Explanation: The longest common subsequence is "ace" and its length is 3. Example 2: Input: X = "abc", Y = "def" Output: 0 Explanation: There is no such common subsequence, so the result is 0.