Review the Common Increasing Subsequence problem and the dynamic solution explained in the lectures, $($textbook$).$ Given the instance X $=($A$,$C$,$E$,$B$,$D$,$C$,$F$,$G$,$H$,$I$)$

and Y $=($B$,$A$,$G$,$C$,$E$,$D$,$H$,$I,C$,$F$)$fill in the corresponding table with the values for each comparison when implementing dynamic programming.

$$

Note: It is true that Dynamic programming is a paradigm and the LCS can be solved with different dynamic programming approaches, however, to standardize the solution, please note that to earn points, the requested implementation is the one given in the textbook and any other solution from a different approach will automatically have $0$ points. Reading assignments are indicated in the course and it is assumed that you are doing them, and you have knowledge of the solution that is being requested