calcWordFrequencies() function from the JavaScript console in the browser.

Implement a function, countVowels, which takes in a string and counts the number of vowels that are contained within it. Make sure that both capital vowels and lowercase vowels are counted. Your starter code contains a main function, which asks for user input and outputs the number of vowels. You will need to implement the user input for the string. Sample Runs (user input is italicized and underlined): Enter a phrase: Hello World!Number of vowels: 3 Enter a phrase: PROGRAMMING IS EXCELLENT.Number of vowels: 7     #include <string>#include <iostream>using namespace std; int countVowels(string word); int main(){   string phrase;  cout << "Enter a phrase: ";  // To do: implement user input    cout << "Number of vowels: " << countVowels(phrase) << endl;}    // To do: Implement countVowels int countVowels(string word){}

Implement a function alterCase in Python that converts a word to "alterCase". Given a word, using any mix of upper and lower case letters, the function then returns the same word, except that the first letter is upper case, the second is lower case, and then cases of letters alternate throughout the rest of the word. >>> alterCase('apple')'ApPlE'

Write a program in Python with a function biggestBuried(s), which the parameter s is a string, and the function returns the largest integer buried in the string. If there is no integer inside the string, then return 0. For example, biggestBuried('abcd51kkk3kk19ghi') would return 51, and biggestBuried('kkk32abce@@-33bb14zzz') would return 33, since the '-' character is treated like any other non digit.  print(biggestBuried('abcd51kkk3kk19ghi'))          answer should be 51 print(biggestBuried('kkk32abce@@-33bb14zzz'))      answer should be 33 print(biggestBuried('this15isast22ring-55'))    answer should be 55