You need to create a code that can detect if there are more than two consecutive consonants in each word. My program should be able to find all of those words that contain at least 2 consecutive consonants. Can you implement such a solution for me? Answer: Here is an example on how you can use regular expressions (regex) to identify if there are more than two consecutive consonants in each word: You only have access to the following programming language/library and need to write a C++ function that solves this problem. You will create a string of characters. Each time, it should remove any words with three or more vowels from its list. There are 10 items and you want to select all of them in ascending order - the one with the fewest letters first.