Consider two protein sequences $A$ and $B$ of lengths $m$ and $n$ respectively. You are tasked with implementing a dynamic programming algorithm to find the optimal global alignment between these sequences. Given the following definitions:

• A match score of $+2$ for identical amino acids.
• A mismatch penalty of $-1$ for different amino acids.
• A gap penalty of $-2$ for each gap introduced.

Which of the following statements is correct regarding the dynamic programming solution for this alignment problem?