Given a string S of characters, write a C function countAndPrint that prints on the screen all the substrings of n characters that contain 2 vowels (remember that in C there is no library function that determines whether a character is a consonant or a vowel, it must be implemented from scratch). The prototype should be the following: void countAndPrint (char str[], int n); Example: if S="forExample" e n= 4, the substrings that are 4-characters long and contain 2 vowels are: "forE", "orEx", "rExa" and "Exam".

Write a C++ function (along with the helper functions) that deletes all occurrences of a word from a given string.  The code should follow the exact function declaration given:  void deleteWords(char*inputString, char*word, char*destString);

Define a function in JAVA that takes a string str as a parameter and returns a string that contains the first 3 characters of str. If the length of str is less than 3 then use the character '*' as a substitute character.

In Phython Language: The DNA of a living organism consists of a string of 4 different bases represented with letters A, T, G, C. The DNA has a double helix structure which means these bases are paired in the string. An A base is always paired with a T base molecule and a C base is always paired with G molecule. Write a function matchingPair that accepts a single strand of the DNA structure as a string parameter and produces the pairing strand as a result and returns it. Strings can be considered as list of characters. Therefore the subscript notation that we use for lists is acceptable for strings as well. For example to reach to the 4th character of a string variable mystring, you may use the notation mystring[3].  Write another function search that accepts a long and a short DNA strand as parameters. The function should return the index positions of the occurrences of the short strand in the long strand as a list. Test your functions by accepting a long strand of DNA to find the…