Below is the dynamic programming grid for computing the pairwise alignment of DEVD and DEEEVW using the Needleman-Wunsch algorithm. Gap penalty = -2 and the scoring scheme used is match = 1 and mismatch =-1. a. Complete row, i = 0, by entering the values and appropriate pointers/arrows above. b. Complete column, j = 0, by entering the values and appropriate pointers/arrows above. c. Determine the value in the cell at row i = 3, and column j = 2. Insert value above with the appropriate pointers/arrows. d. Determine the value in the cell at row i = 3, and column j = 4. Insert value above with the appropriate pointers/arrows. e. Determine the value in the cell at row i = 6, and column j = 4. Insert value above with the appropriate pointers/arrows. f. What is the best score for the alignment? g. Write the alignment/s giving the best score. Below is the dynamic programming grid for computing the pairwise alignment of DEVD and DEEEVW using the Needleman-Wunsch algorithm. Gap penalty = -2 and the scoring scheme used is match = 1 and mismatch =-1. a. Complete row, i = 0, by entering the values and appropriate pointers/arrows above. b. Complete column, j = 0, by entering the values and appropriate pointers/arrows above. c. Determine the value in the cell at row i = 3, and column j = 2. Insert value above with the appropriate pointers/arrows. d. Determine the value in the cell at row i = 3, and column j = 4. Insert value above with the appropriate pointers/arrows. e. Determine the value in the cell at row i = 6, and column j = 4. Insert value above with the appropriate pointers/arrows. f. What is the best score for the alignment? g. Write the alignment/s giving the best score