get_nth_comma_in_string(s, n): This function takes a string s and a non-negative integer n as input. It returns the index of the n’th comma in the string s. We will start counting at 0, so if n=0, then the index of the first comma should be returned; if n=1, then the index of the second comma should be returned, and so on. If there is no n’th comma in s, then -1 should be returned. Note: You may use the string find method in this function.

// MichiganCities.cpp - This program prints a message for invalid cities in Michigan.   // Input:  Interactive // Output:  Error message or nothing #include <iostream> #include <string> using namespace std; int main()  {    // Declare variables    string inCity;   // name of city to look up in array    const int NUM_CITIES = 10;    // Initialized array of cities    string citiesInMichigan[] = {"Acme", "Albion", "Detroit", "Watervliet", "Coloma", "Saginaw", "Richland", "Glenn", "Midland", "Brooklyn"};     bool foundIt = false;  // Flag variable    int x;         // Loop control variable    // Get user input    cout << "Enter name of city: ";    cin >> inCity;        // Write your loop here             // Write your test statement here to see if there is        // a match.  Set the flag to true if city is found.                              // Test to see if city was not found to determine if     // "Not a city in Michigan" message should be printed.…

Problem: Substring Pattern Matching Input: A text string t and a pattern string p Output: Does t contain the pattern p as a substring, and if so, where? For example: with t= abaababbaba, p = abba, your function should return 5. int findmatch(char *p, char *t) { int plen = strlen(p); // len of string int tlen = strlen(t); // len of string t //TODO: your code } Analyze your algorithm: what is the big O?

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