Find a longest common subsequence (LCS) of two DNA sequences and fill the following table using the method described in the course. S1= CGATAG S2=GCATA C G A T A G C A A Remember: When you fill in a cell, you consider: 1. The cell directly to the left of it 2. The cell directly above it The cell to the above-left of it. The three values below correspond, respectively, to the values returned by the three recursive subproblems I listed earlier. 3. 4. V1 = the value in the cell to the left 5. V2 = the value in the cell above 6. V3 = the value in the cell to the above-left You fill in the empty cell with the maximum of these three numbers: V1, V2, V3 + 1 if C1 equals C2, or V3 if C1 is not equal to C2, where C1 is the character above the current cell and C2 is the character to the left of the current cell Note that, add arrows that point back to which of those three cells that been used to get the value for the current cell. In the case of equal numbers, where the new number could have come from more than one cell, pick an arbitrary one: the one to the above- left, say have more priority than the one comes from left than the one comes from above.