In C++ please!

Function 2. Find Best Match (40 points) We will use the term genome to refer to the string that represents the complete set of genes in an organism, and sequence to refer to some substring or sub-sequence in the genome. Write a function called findBestMatch that takes a genome and a sequence and returns the similarity score of the best match found in the genome as a float. HINT: Problem 3 from Recitation 5 is very similar to this function. We encourage you to write that function before attempting to write this one. Your function should take two parameters in this order: a string parameter for the genome a string parameter for the sequence o Your function should return the highest similarity score as a float. Your function should not print anything. Your function MUST be named findBestMatch. o Edge Cases: sequence is empty genome is empty sequence is longer than genome return-1 return-1 -return-2 Examples: "ATACGC", "ACT" 0.66