l Verizon LTE 2:27 PM a bb2.uhd.edu All code must be written in C++ (C+ was also used in CS1, CS2, and CS3). You should submit e The source codes. A document showing the output for test cases Put all the individual files in one single folder and compress the folder. Upload the compressed folder. Files should include your first and last names. 1. Implement a function to compute the Hamming Distance between two DNA sequences. The function needs two DNA sequences as inputs. The output should be the Hamming distance between the two input DNA sequences [10 points). Some test cases are i. Output-2, when inputs are AAAAAA and ACAAA ii Output 1, when inputs are AAAAAA and ACAAAA iii. Output 6, when inputs are AAAAAA and TCGCTG 2. Implement a function to compute the TotalDistance(v DNA) method in the context of median string finding problem. (30 points] The function requires two inputs e v: a given k-mer DNA-a set of DNA sequences. You can use array to store the DNA sequences. The function should have two outputs . Best match (along with the position: use 0-based meaning 0 indicates first position) of the given k-mer (v) in each DNA sequence in DNA. e The distance. Test Case 1 For the 10 DNA sequences in file Sequences.fa given in BB, and v TAGATCCGAA, a sample output is. Bestmatch Pos Hamming Distance TAGATCTGAA 171 TOGATCCGRA 471 TAAATCCGAA 33 TAGGTCCAAA 21 2 TAGATTCGAA CAGATCCGAA 46 TAGATCCGTA 701 TAGATCCAAA 16 1 TCGATCOGAA 65 Total distance 11 Test Case 2 For the 10 DNA sequences in file Sequences.fa given in BB, and v TAGATCCGAA, a sample output is. Besteatch Pos Hamm.ing Distance 30 2 34 2 25 2 17 1 26 2 GAAATA GAAATG 54 2 19 3 10 1 Total distance 21