using regex create a python program to verify the string having each word start from 'e'? It should return True otherwise false.

Scala Programming: Given string str, write a Scala program to create a new string where "Scala " is added to the front of a given string. If the string already begins with "Scala", return the string unchanged. Otherwise, return the string after adding "Scala ". Test the function for two strings "Scala Programming" and "Programming" inside the main method.

C Programming Language Note: Input and Output Must be the same Write in C Language

Match the std::string constructor on right to its function on left. Source: https://cplusplus.com/reference/string/string/string/ E string() string (const string& str) string (const char* s) string (size_t n, char c) [Choose] [Choose ] constructs a copy of str. constructs an empty string, with a length of zero characters. copies the null-terminated character sequence (C-string) pointed by s. fills the string with n consecutive copies of character c. [Choose ]

Python question Analysis: Invariants (Q16-17) For each of the following functions, identify the loop invariant, exit condition and post condition.    Question 16 (Invariant 1) This function returns the list of integers that are multiples of both 3 and 7 that occurs within a given list. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of the loop, which shows the algorithm’s correctness. def multiples_count(lst):    """    Input: a list of integers, lst    Output: the list of integers in lst that are multiples of both 3 and 7    """    res = []    for i in range(len(lst)):        if lst[i]%3 == 0 and lst[i]%7 == 0:            res.append(lst[i])        # Identify the loop invariant here    return res Question 17 (Invariant 2) This function checks if a given list (of comparable elements) is sorted in ascending order. Identify the loop exit condition, the loop post-condition, and the loop invariant at the end of each iteration of the loop, which…