Complete the Function Below:

Code in C++

Every project on Thumbtack belongs to a category. Each set of two categories has a relevance score from 5 to 1. which represents how relevant they are to each other. A category has a relevance score of 1.6 to itself SEGIUL + ZXCVDNV Every time a project that belongs to a user is completed, the Thumbtack search bar updates to display the k most relevant category suggestions for that user. These top categories are chosen by first sorting all the categories that are relevant to at least one of the already created projects by relevance Then, in the case that their relevance is equal, they should be sorted by category name. If the same category is relevant to 2 or more projects, it should be included only once with the maximum relevance score. If there are fewer than k total relevant projects the suggestions list will be shorter thank You have a relevance graph of all the Thumbtack categories, represented as an array of strings of comma-separated words. For each string in categories, the first two elements are the categories being compared and the third is their relevance score. You are also given an array of the categories of the projects that a particular user wants to create For example: "House Painting, Interior Painting, 0.8" means that House Painting and Interior Painting have a relevance score of 8.8 (ie. highly relevant) and "Handyman, Massage Therapy, 0.1" means that Handyman and Massage Therapy have a relevance score of 8.1 fle barely relevant) Note that if there is no entry for particular pair of categories, it means that their relevance is . (le they aren't relevant at all and they shouldn't be included in the list of suggestions) Given the relevance graph categories, the list of the user's projects, and the number of category suggestions the user should see in the Thumbtack search bar k return an array of arrays that represents the state of the search bar suggestions list after each of the projects in projects is created Example For categories - "House Painting, Interior Painting,0.9", Handyman, Massage Therapy,0.1", "Handyman, House Painting,0.5", "House Painting, House Cleaning,0.6", "Furniture Assembly, Handyman, 0.8", "Furniture Assembly, Massage Therapy,0.1", "Plumbing Drain Repair, Junk Removal,.3 projects = ["House Painting", "Handyman"), and k = 3, the output should be categorySuggestions (categories, projects, k) = (["House Painting", "Interior Painting", "House Cleaning"], ["Handyman", "House Painting", "Interior Painting"]]. After the first project House Painting is completed the most relevant suggestions are in order of their relevance Category Relevance House Painting 10 Interior Painting 09 0.6 House Cleaning Handyman 0.5 After the second project is completed the most relevant suggestions are: Category Relevance Handyman 10 House Painting Interior Painting 0.9 Furniture Assembly House Cleaning 0.6 Massage Therapy01 Input/Output [input) array string categories Category relevancies given in the format , , with will be distinct). Category names can only consists of spaces and English letters. Guaranteed constraints: @s categories. Length 1888, 5 s categories[i]. Length 50. [input] array string projects The categories to which the user's projects belong Guaranteed constraints: Os projects.lengths 1000, 1 s projects il.length 30 [input] integerk The number of category suggestions that should be shown in the user's search bar. Guaranteed constraints: Osks 50 (output] array array string Return the state of the search bar suggestions ist after each of the projects in projects is created i v #include 3 using namespace std; string ltrim(const string 2); string rtrim(const string 2); * Complete the 'category Suggestions' function below. * The function is expected to return a 2D_STRING_ARRAY. * The function accepts following parameters: * 1. STRING_ARRAY categories * 2. STRING_ARRAY projects * 3. INTEGER K vector> category Suggestions (vector categories, vector projects, int k) { 22 } 23 24 > int main()