Following is the dynamic programming matrix genertaed by Needleman-Wunsch algorithm to find the optimal alignment between two sequences X and Y with different sizes. Determine from the matrix the score attributed when a gap is created.Dynamic programming matrix:.