In this project, you will implement the dynamic programming-based solution to find the longest common subsequence (LCS) of two sequences. Your inputs will be the two sequences (as Strings) and the outputs are the longest common subsequence (printed as a String) and the final matrix (printed as a two-dimensional array) depicting the length of the longest common subsequences (as shown in the slides) for all possible subsequences of the two input sequences. The two input sequences to be used by each student are shown below. The LCS expected for the two sequences is also shown. Row Sequence LCS ??? AGGACTGACCTG GACCGTTGGACT GACTGACT sample output is shown below Row Sequence: Co lumn Sequence:ATGCGGGG A word document containing the following: ATIAGTCTCGA Submission (through Canvas) 0a 0 1 2 2 2 2 2 2 2 2 0 1 2 2 2 2 2 2 2 2 0 1 2 2 2 2 2 2 2 2 01 2 3 3 3 3 33 3 0 1 2 3 3 33 33 3 0 1 2 3 3 44 4 4 4 0 1 2 3 3 4 4 4 4 4 0 1 2 3 4 4 4 4 4 5 0 1 2 3 455555 0 1 2 3 455555 LCS: ATGGC (i) entire code (ii) the outputs showing the final dynamic programming table (of the lengths of the longest common subsequences of all possible subsequences of the two input strings) and the longest common subsequence (iii) the final alignment (determined manually by working out the alignment based on the table printed in ii, and typed in the word document) of the two input strings and the gaps ( that need to be introduced in order to facilitate an alignment that matches with the LCS obtained