Must be in C++ and use of recursion

Part 1: Unscramble Implement Unscramble. This function takes as parameters a std::string of letters to unscramble and a dictionary of English words in a std:: map<:string bool>& . Instead of printing every word like in ListPermutations , your function should only print out words which are in the dictionary A word is in the dictionary if the value at that key is true. For example, we can check if the word "CAT" is in the map words as follows: if (words ["CAT"]) { std::cout