"

please write a working" program using Java programming language.

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. Column Sequence GGGGTAACT LCS TCT Student Name Leon Andersor Uijwal Baskota Albert Boateng Nissi Campbell Samuel A. Da James Daniel Zakeia Davis Justin E Amanuel E. Gebre TCGCCIT TAAAATCTAG GTGTGGAAAC AGGACGGTGAA CITGGATC ATITTTA CGAGGTAACTAG ATAGAAATC TEGGGAT GAGACAGGAT GTGAGGGGGA CTAGCAGT AGTGCCG AATA CGAGGGA GAAT KLA CAGGAT TAGG GAGCAT oTGC TCACC EAATA GGAG GCTATTAT TTCTGATGTT CAGATGTATCTG CTCAGGT felrondarius Groom GATTGCACTA Yoseph HailemariamGCTAAGC Antonie Hobson Portia Junius Justin McGuffee Ryun Moore Keara Rogers Timothy Stewart Nebiyou Tadesse Phat Tran ATCAC TTTTAATCCAGC GAGTAAG GCGACG ACAGGC TATCA/A AGGACTGACCTG GCTACCATGOCAG TIGNCSTGCO AGAGC TATCA GACTGACE GACTGCOA GGACTCCCCAG GACCGTTGOAO A sample output is shown below