Write a function in c called recursively_reverse_string() that accepts a pointer to a string as a parameter, and any other parameters you see fit, recursively reverses the string, and returns a pointer to the reversed string. For example, the reversed string of input “string” is “gnirts”.

PLease! in c++ Write a function named “getNonNegativeSum” that takes in 4 input parameters: -a pointer to thearray of integers-its size, -the index tostart the sum from -the count of how many numbers from that starting index It will return the sum of all values from the startingindex with the number count of how many. It will add to the sum if the number in the array is positiveand skip all negative values. If there is an error in the indexor not enough numbers to count, it will return -1. For example,int numList[] = {10, 20, -1, 30}; If the starting index is 1 and the count of 3, it will return 50 If the starting index is 2 and the count of 2, it will return 30 If the starting index is -1 and the count of 2, it will return -1 If the starting index is 2and the count of 5, it will return -1.int priceList[] = {10, 20, 30, -1, 40}; If the starting index is 0, and the count is 1, it will return 10 If the starting index is 1, and the count is 3, itwill return 50 If the starting index is 0,…

in c++   Write a function named “contains” that accepts a vector of Variableobject pointers and a search string. It will return the list of Variableobject pointers that contains that search string.Please note that the list can contain pointers to both Variable or VariableString objectsor any of its derived class objects. Build a list of pointers pointing to mixed objects of Variable and VariableString objectsand show your function returns the mix of both.

//the language is c++ Implement function to tokenize a string.   std::vector<std::string> tokenize(std::string& line) { }   int main(){ std::string ts = "This is a string with no commas semicolons or fullstops"; std::vector<std::string> tok = tokenize(ts); for (auto x : tok) {    std::cout<<x<<std::endl; }  return 0; }

In Python3, write the code for a function mult_3 that returns a list of all non-negative multiples of 3 that are less than or equal to a given argument n.

Consider the function void modify(int & x) { x = 10; }Show how to call the modify function so that it sets the integer int i;to 10.

Here is a function that is supposed to return True if word (any string) ends with "s" and False otherwise: def ends_with_s(word):if len(word) < 1:return False    return word[-1] == "s" Here is the test function I am using to test ends_with_s: def test_ends_with_s():    assert(ends_with_s("cats")) # option 1    assert(ends_with_s("") is False) # option 2    assert(ends_with_s("apple") is False) # option 3    assert(ends_with_s("S")) # option 4   Rewrite ends_with_s so that the test passes

Write a javascript function that takes a string as a parameter and returns the first character that is not repeated in the string. function nonRepeatingChar(str) { I/returns the first non-repeating character in str }