Question $8$

The last step for solving the Longest Common Subsequence $($LCS$)$ problem using dynamic programming is to extract a LCS from the DP table $($array L$).$ Consider the Print$-$LCS procedure discussed in class. Determine whether the following modified versions will still be able to output a LCS correctly.

$\backslash$table$[[\backslash$table$[[$Print$-$LCS$-1($L$,x,Y,m,n$