-In class we discussed in detail three methods for pairwise alignment that utilize the dynamic programming algorithm: Needleman-Wunsch, Waterman-Smith-Beyer, and Smith-Waterman algorithms. For each work and example by hand to implement the pairwise alignment for two short sequences.

-Write a program two of the above algorithms for pairwise alignment. The program should take two input sequences and output all optimal alignments. The program should also have the ability to easily adjust the scoring function.