Write a C++ program using Selection Statements, Loop, Arrays, Structs, Pointers, Funtions, and OOP ONLY that would implement the function called filter which accepts a string f that contains numbers and letters mixed up. The function must return an integer corresponding to the numbers in f in the order that they appear. If there are no numbers in f, the function should return O. Assume that all the inputs are strings (no need for try-catch method) EXAMPLE OF THE OUTPUT OR TERMINAL: filter('321') = 321 filter('fndjksanfjka") = 0 filter('nfeu 1d8d1d3 adas7') = 18137

Launch Meeting - Zoc X S Launch Meeting Zoc X Is Everyone Really Equ x E Reading Response 6 OCh7: Oppression & Se x SThank you for downlc X s.ucsc.edu/courses/46018/assignments/294537 2. are_anagrams This function takes two strings and returns True if they are anagrams of one another, which is to say that they contain the same letters, possibly rearranged, ignoring spaces and case. You can assume that the two input strings contain only letters and spaces. Sample calls should look like this: >>> are_anagrams ("bimmy is my friend", "My Bird Fey Minims") True >>> are_anagrams ("bimmy is my friend", "hello everyone") False >>> are_anagrams ("internet anagram server", "I rearrangement servant") True >>> are_anagrams ("internet anagram server", "internet anagram server") True 3. find_movies_by_director 4:11 PM This function takes a list of tuples (representing movies) and a string (representing a name of a director) and returns a 65°F Sunny 11/2/2021 e search

1. What does the following code segment return assuming the argment passed is a single word or short phrase   def mystery3(word: str) -> str:output = ""for char in word:output = char + outputreturn output   2. Write a function called removeVowels that accepts a string as a parameter and return a copy of that string with no vowels (aeiou) in it. Upper case and lower case vowels will be remove and the rest of the string is not changed.     For example removeVowels("The Quick Brown Fox) would return "Th Qck Brwn Fx"

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.

vowelIndex Write a function vowelIndex that accepts a word (a str) as an argument and returns the index of the first vowel in the word. If there is no vowel, -1 is returned. For this problem, both upper and lower case vowels count, and 'y' is not considered to be a vowel. Sample usage: >>> vowelIndex('hello') 1 >>> vowelIndex('string') 3 >>> vowelIndex('string') 3 >>> vowelIndex('BUY') 1 >>> vowelIndex('APPLE') 0 >>> vowelIndex('nymphly') -1 >>> vowelIndex('string')==3 True >>> vowel Index ('nymphly')==-1 True

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.

Scrabble Scrabble is a game where players get points by spelling words. Words are scored by adding together the point values of each individual letter. Define a function scrabble_score (word:str) -> int that takes a string word as input and returns the equivalent scrabble score for that word. score = {"a": 1, "c": 3, "f": 4, "i": 1, "1": 1, "o": 1, "r": 1, "u": 1, "t": 1, "x": 8, "z": 10} For example, "b": 3, "h": 4, "n": 1, Your Answer: == 20 assert scrabble_score("quick") assert scrabble_score("code") == 7 1 # Put your answer here 2 Submit "e": 1, "d": 2, "g": 2, "k": 5, "j": 8, "m": 3, "q": 10, "p": 3, "s": 1, "w": 4, "v": 4, "y": 4,

In c++ Please Write the InOrder() function, which receives a vector of integers as a parameter, and returns true if the numbers are sorted (in order from low to high) or false otherwise. The program outputs "In order" if the vector is sorted, or "Not in order" if the vector is not sorted. Ex: If the vector passed to the InOrder() function is [5, 6, 7, 8, 3], then the function returns false and the program outputs: Not in order Ex: If the vector passed to the InOrder() function is [5, 6, #include <iostream>#include <vector>using namespace std; bool InOrder(vector<int> nums) {    /* Type your code here */} int main() {     vector<int> nums1(5);    nums1.at(0) = 5;    nums1.at(1) = 6;    nums1.at(2) = 7;    nums1.at(3) = 8;    nums1.at(4) = 3;     if (InOrder(nums1)) {        cout << "In order" << endl;    }    else {        cout << "Not in order" << endl;    }     vector<int> nums2(5);    nums2.at(0) = 5;    nums2.at(1) = 6;…

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