Tabular computation of optimal alignment

The problem can be evaluated systematically using a tabular computation. In this approach, we compute V(i,j) for the all possible values of i and j. We start from smaller i,j and increase them, filling the table in a row-wise manner. We store these values in table of size 15#15. Finally V(n, m) is the required alignment score. The following pseudo code describes the algorithm:
16#16

 17#17