Consider the alignment of two DNA sequences CAG and TACG. Below, the substitution matrix used for the alignment (on the left and an incomplete dynamic programming table (on the right) used for finding the optimal alignment are shown. Assume a linear gap penalty is being used. You need to infer the gap penalty from the dynamic table built so far. What score should be written in the entry of the dynamic programming table that is highlighted with the yellow circle?