n formal language theory and computer programming, string concatenation is the operation of joining character strings end-to-end. For example, the concatenation of "hello" and " world" is "hello world". Write a function in C language. The function name is conscat_strings that takes a char** as a parameter and return a char* Then in the main function we call the conscat_strings function. Assume the maximum input char number is 100, you do not have to calcualte the number of total chars For example, if I compile the file whcih name is homework1.c by using the gcc on the terminal, I just type gcc homework1.c -o homework.out in mac or gcc homework1.c -o homework.exe in windows. Then I am trying to call the outpout, if I only type ./homework1.out, It should give a hint such as please input at least 3 arguments (inlcude ./homework1.out or ./homework1.exe). if I only type ./homework1.out hello It should give a hint such as please input at least 3 arguments (inlcude ./homework1.out or ./homework1.exe). if I type ./homwork.out hello welcome to CSC332, the result should be hello+welcome+to+CSC332 Only accpet stdio and stdlib in this homework

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?

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

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,

Using C++ Language Write a program to implement the following: • Declare two C-strings str1 and str2 of appropriate sizes. • Use strcpy() to copy the string "Hello World." into str1 • Using a suitable message, read the user input into str2. The user may enter more than one word. • Determine and store the length of both char arrays using strlen() • Check if both char arrays are the same length using the stored lengths o If they are the same length, tell the user they are the same length o If they are not the same length, tell the user the strings are different and end the program using a return statement. • Compare both strings using strcmp to check if they are the same string. o If they are the same string, inform the user of this o If they are not the same string, inform the user of this o Note that you compare only if they are of the same length, hence the return statement in the earlier step.

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 ]

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

4. Complete the function show_upper. This function takes one parameter - a string (s). It should return a string made up of all the upper-case characters in s. For example, if s is "aBdDEfgHijK" then show_upper should return "BDEHK". It should return the upper-case string - not print it. Do not change anything outside show_upper.