Write a function in c++ that follows the code format in the editor to the right. Please follow all the constraints and directions.

#1nclude #include 1 Two phrases are anagrams if they are permutations of each other, ignoring spaces and capitalization. For example, "Aaagmnrs" is an anagram of "anagrams, and "TopCoder" is an anagram of "Drop Cote". Given a vector phrases, remove each phrase that is an anagram of an earlier phrase, and return the remaining phrases in their original order 2 4vector phrases) // fill in code here Constraints .phrases contains between 2 and 50 elements, inclusive Each element of phrases contains between 1 and 50 characters, inclusive Each element of phrases contains letters (a'- and 'A-Z') and spaces only Each element of phrases contains at least one letter. Examples 1. "Aaagmnrs", "TopCoder", "anagrams", "Drop Cote" ) Returns:"Aaagmnrs", "TopCoder" The example above. 2. "SnapDragon vs tonek", "savants groped monk", "Adam vents prongs ok" Returns: "snaporagon vs tonek 3. f"Radar ghost jilts kim", "patched hers first "DEPTH FIRST SEARCH", "DIJKSTRAS ALGORITHM" } Returns: "Radar ghost jilts Kin", "patched hers first"h