Write a recursive function 'void reverse(string &word)' that reverses the given input string. string name = "lexa"; reverse(name); cout << name << endl; //should display "axel". without using the following loops: -no for loops -no while loops -no do-while's -no while-do's -no for-while's -no while-for-do's

in C++ Write an inductive function, called IndFn, for adding 12+10+8+6+4  Write a function with a procedural loop, called ProFun, for adding 14+12+10+8+6+4;

Ex. 8.4) The following functions are all intended to check whether a string contains any lowercase letters, but at least some of them are wrong. For each function, describe what the function actually does (assuming that the parameter is a string).

For each function, describe what it actually does when called with a string argument. If it does not correctly check for lowercase letters, give an example argument that produces incorrect results, and describe why the result is incorrect. # 1 def any_lowercase1(s):     for c in s:          if c.islower():               return True          else:               return False # 2 def any_lowercase2(s):     for c in s:          if 'c'.islower():               return 'True'          else:               return 'False' # 3 def any_lowercase3(s):     for c in s:          flag = c.islower()     return flag # 4 def any_lowercase4(s):     flag = False     for c in s:          flag = flag or c.islower()     return flag # 5 def any_lowercase5(s):     for c in s:          if not c.islower():               return False     return True The code and its output must be explained technically whenever asked. The explanation can be provided before or after the code, or in the form of code comments within…

6. Given the following main function: // remove the first digit of a number int main() { int n, m; cout >n; m-removeFirst(n); cout <

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

5. use c code to Write a stringSearch function that gets two strings one called needle and the other called haystack. It then searches in the Haystack for the needle. If it finds it, it returns the index of where the needle starts in the haystack. If the needle cannot be found, it should return -1 Prototype: int stringSearch(char needle[], char haystack) Example1: Haystack: “This is just an example” Needle: “just” Result: 8 Example2: Haystack: “This is just an example” Needle: “This” Result: 0 Example3: Haystack: “This is just an example” Needle: “this” Result: -1 Hint: all the answer need to include an output and use c code to answer

Do in Scala language

Problem taken from LeetCode  // Problem Statement : //      You are given a string. // Write a function that takes a string as input and reverse only the vowels of a string.  // Example : //      Sample Input - 1 : //          "hello" //      Sample Output - 1 :  //          "holle"  //      Sample Input - 2 : //          "leetcode" //      Sample Output - 2 :  //          "leotcede"   class Solution {public:    string reverseVowels(string s) {        int i = 0 , j = s.size() - 1;        while(i < j) {            while(i < j &&                   (s[i] != 'a' &&                   s[i] != 'e' &&                   s[i] != 'i' &&                   s[i] != 'o' &&                   s[i] != 'u' &&                   s[i] != 'A' &&                   s[i] != 'E' &&                   s[i] != 'I' &&                   s[i] != 'O' &&                   s[i] != 'U'                   )) {                      i++;…