Given a certain string, identify using linear search if the given string is spelled correctly. Problem Details: . For this problem, your sample input will be the string SEPERATE. Obviously, we know that it is spelled incorrectly. However, your code must employ a linear search approach to check whether it is spelled correctly or incorrect through a function called stringCheck. • The intended output must return whether the input string is spelled correctly or incorrectly. • Your driver code must look something like this: int nain() string test "SEPERATE"; stringcheck(test); (1F stringchecksstrue) cout e "Correct spelling!"; reture :

For input vector x, write a function to check whether there exists at most 5 elements in x whose values are less than 7.

Question 2: Encoding Cryptography is the study of trying to create secure information by obscuring the original message. One simple encryption method is to substitute letters from the original message with other letters. To make it harder to decrypt the hidden message, we may also remove clues such as the length of the words in the message and any punctuation or capitalization. Write a function encode that consumes a string message. The function produces a string which is encrypted according the following procedure: • Only the letters from the original message will be encrypted. Other characters such as spaces, punctuation, numeric digits, etc. are not included in the encrypted message at all. • The encrypted message will only contain uppercase letters. • Each letter will be replaced by the uppercase letter at the opposite end of the English alphabet. In other words, A or a will become z, B or b will become Y, C or c will become x, .., z or z will become A. • The encrypted message will…

Given a string containing only parentheses (, ), {, }, [, and ], determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct order. Write a function isValidParentheses that takes in a string s and returns a boolean value indicating whether the parentheses in s are valid. Example: Input: s = "{[()]}" Output: true Input: s = "{[()]}" Output: false Input: s = "{[(])}" Output: false Input: s = "{[()]}()[]" Output: true Note: The input string will only contain the characters (, ), {, }, [, and ]. An empty string is considered valid.

Without importing any Lib:

We can assign a value to each character in a word, based on their position in the alphabet (a = 1, b = 2, ..., z = 26). A balanced word is one where the sum of values on the left-hand side of the word equals the sum of values on the right-hand side. For odd length words, the middle character (balance point) is ignored. Write a function that returns true if the word is balanced, and false if it's not. Examples balanced ("zips") → true // "zips" = "zi|ps" = 26+9|16+19 = 35|35 = true balanced ("brake") // "brake" = "br|ke" false = 2+18 | 11+5 = 20 16 = false

Do the part b of the attached question  thanks