Please write in C++

2. Longest Common Subsequence (35) Write the code for computing the longest common subsequence. Using this code find the LCS between each pair of protein sequencein the filke tulp3 relatives (a) Submit a clear and well commented code. We will test your code on some other se- quences (10 points) (b) Find the LCS for each sequence to every other sequence (10 points) (c) Based on the length of the LCS, create groups of organisms, where organisms in the same group will have longer LCS. Describe clearly the algorithm/software that you used to compute the groups. Show the groups.(10) (d) Go to this website" https://www.ebi.ac.uk/Tools/msa/clustalo/". Under the space for enter your input sequence, copy and paste the content of the file tulp3.relatives. Then press submit. Once the processing is done, click on phylogenetic tree. The tree also groups the organisms. Compare this grouping with the one you obtained