Write code for Needleman Wunsch algorithm for solving the Global Alignment

Problem. You can use any programming language. Please follow the pseudocode
given in your slide. You will have to calculate optimal alignment score and you will
also have to find one optimal alignment (pseudocode not given. Think this one
out for yourself. It’s easy) between the input pair of strings. Assume,
Del(x, x) = 2
Del(x, _) = -1
Del(x, y) = -2

Input:
S: GGTTGACTA
T: TGTTACGG

Output:
(1) Print the alignment matrix
(2) Print optimal Alignment score
(3) Print one optimal alignment between S and T (there can be more than one
optimal alignment. Showing any one of them is fine)

Deliverables:
(1) Executable Code
(2) A PDF file containing the alignment matrix, alignment score and one
alignment between S and T