(6) Implement the ReplaceExclamation() function. ReplaceExclamation() has a string parameter and updates the string by replacing each '!' character in the string with a '.' character. ReplaceExclamation() DOES NOT output the string. Call ReplaceExclamation() in the PrintMenu() function, and then output the edited string. Ex. Edited text: We'll continue our quest in space. There will be more shuttle flights and more shuttle crews and, yes, more volunteers, more civilians, more teachers in space. Nothing ends here; our hopes and our journeys continue.

Implement the fix_capitalization() function. fix_capitalization() has a string parameter and returns an updated string, where lowercase letters at the beginning of sentences are replaced with uppercase letters. fix_capitalization() also returns the number of letters that have been capitalized. Call fix_capitalization() in the print_menu() function, and then output the edited string followed by the number of letters capitalized. Hint 1: Look up and use Python functions .islower() and .upper() to complete this task. Hint 2: Create an empty string and use string concatenation to make edits to the string. Ex: Number of letters capitalized: 2

Write a program that reads words from a file (filename given as a string parameter) and prints the occurance of each word(case insensitive). And print the words in alphabetical order. For example, if the file contains text Love is free free is love then the function should print free:2 is:2 love:2   def count_word(filename):     # YOUR CODE HERE    raise NotImplementedError()

1. a.Palindromes Complete the function palindrome(String text). Return true if text is a palindrome; if the word is identical forward and backward. Otherwise, return false. Example:  palindrome(“racecar”) == true palindrome(“kayaks”) == false See main() for more examples. You can use text.charAt(i) to find the character at index i of text. Use recursion. palindrome() should call itself. No loops allowed. b. Complete the function nestedBrackets(String s). This function should find properly nested brackets within s. Return true if brackets are opened and closed correctly, and false otherwise.  Single pairs and nested pairs are valid. For example: z[z]z, [zz[zz]z], [z[[z]zzz]], zzzzz Incorrect pairings and multiple separate pairs are not valid. For example: zz[zz, ]zzz[, [zzz][z], [z[z][z]z] See main() for more examples. nestedBrackets() should call firstIndexOf() and lastIndexOf() to help you solve the problem. Use recursion. nestedBrackets() should call itself. No loops…

Define a function RemoveCommas() that takes a string parameter and returns a string. The returned string is the parameter with all of the commas removed. Ex: RemoveCommas("mouse,toy,fox,bear,pet") returns "mousetoyfoxbearpet" Recall string's size() returns the number of characters in a string. Ex: myString.size() string's at() returns a character at the specified position in the string. Ex: myString.at(3)   #include <iostream>#include <string>#include <cctype>using namespace std; /* Your code goes here */ int main() {   string input;   string output;    getline(cin, input);        output = RemoveCommas(input);      cout << output << endl;    return 0;}

e) Create a new StringBuilder from the String "Prepare for your Midterm Exam". Check the capacity of the StringBuilder and if it's empty. Find the index of the letter 'y'. Delete a substring from the starting index till this index (of 'y'). Insert a string "Good luck on " at the beginning of the StringBuilder. Append '!" to it. Print your StringBuilder to Console.

Implement the following function: Code should be written in python.

Q1. Implement regular expression matching with support for '.' and '*'. '.' Matches any single character.'*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should be:bool is_match(const char *s, const char *p) Some examples:is_match("aa","a") → falseis_match("aa","aa") → trueis_match("aaa","aa") → falseis_match("aa", "a*") → trueis_match("aa", ".*") → trueis_match("ab", ".*") → trueis_match("aab", "c*a*b") → true""" def is_match(str_a, str_b):    """Finds if `str_a` matches `str_b`     Keyword arguments:    str_a -- string    str_b -- string    """    len_a, len_b = len(str_a) + 1, len(str_b) + 1    matches = [[False] * len_b  for _ in range(len_a)]     # Match empty string with empty pattern    matches[0][0] = True     # Match empty string with .*    for i, element in enumerate(str_b[1:], 2):        matches[0][i] = matches[0][i - 2] and element == '*'     for i, char_a in enumerate(str_a, 1):…

Create a variable containing the string “I hate Python” Turn it into a more positive string: “I love Python” using replace method and print the output Finally print out the middle letter of the new string using the len method (do not simply count the letters and print the letter without using the len() method!)

How does data binding contribute to the overall user experience in software applications?