/** * Look for patterns like "zip" and "zap" * in the string -- length-3, starting with * 'z' and ending with 'p'. Return a string * where for all such words, the middle letter * is gone, so "zipXzap" yields "zpXzp". * Examples: zipZap("zipXzap") -> "zpXzp" zipZap("zopzop") -> "zpzp" zipZap("zzzopzop") -> "zzzpzp" * @param str the input string * @return a new string as described */ // TODO: Write method zipZap here...

Construct dfas that accept the followings: a. Set of all strings on {0,1} that do not contain two consecutive 0s b. Set of all stings on {0,1} that end with two 0s

Please dont copy and paste previous solutions. I checked them they are wrong.

Revorse the vewels def reverse_vowels(text): Given a text string, create and return a new string constructed by finding all its vowels (for simplicity, in this problem vowels are the letters found in the string 'aeiouAEIOU') and reversing their order, while keeping all other characters exactly as they were in their original positions. However, to make the result look prettier, the capitalization of each moved vowel must be the same as that of the vowel that was originally in the target position. For example, reversing the vowels of 'Ilkka' should produce 'Alkki' instead of 'alkkI'. Applying this operation to random English sentences seems to occasionally give them a curious pseudo-Mediterranean vibe.Along with many possible other ways to perform this square dance, one straightforward way to reverse the vowels starts with collecting all vowels of text into a separate list, and initializing the result to an empty string. After that, iterate through all positions of the original text.…