In kotlin, Write a recursive linear search function that takes a String and a Char and returns true if the String contains the Char.  The base cases are that a) the length of the String is 0 or b) the first character in the String is the character we are searching for. then Modify the linear search function so that both the String and the Char are nullable.  If either is null, return false.

code should be python: write a function that allows the input of a list of strings as its only parameter. Inside the body of the function find the first palindromic word and return it. If there is no such word, it should return an empty string. A string is palindromic if it reads the same forward and backward so for example If we call the function with [“horse”, “rat”, “roar”, “dad”, “mom”], the returned value should be “dad”. Note that “mom” is also a palindrome, but it is not the first one.

1. a.Palindromes Complete the function palindrome(String text). Return true if text is a palindrome; if the word is identical forward and backward. Otherwise, return false. Example:  palindrome(“racecar”) == true palindrome(“kayaks”) == false See main() for more examples. You can use text.charAt(i) to find the character at index i of text. Use recursion. palindrome() should call itself. No loops allowed. b. Complete the function nestedBrackets(String s). This function should find properly nested brackets within s. Return true if brackets are opened and closed correctly, and false otherwise.  Single pairs and nested pairs are valid. For example: z[z]z, [zz[zz]z], [z[[z]zzz]], zzzzz Incorrect pairings and multiple separate pairs are not valid. For example: zz[zz, ]zzz[, [zzz][z], [z[z][z]z] See main() for more examples. nestedBrackets() should call firstIndexOf() and lastIndexOf() to help you solve the problem. Use recursion. nestedBrackets() should call itself. No loops…

Write a Python recursive function called contains_vowel that, given a list of strings, returns True if every string in the list contains a vowel, and False otherwise. Here are some example inputs and outputs: ● contains_vowel([“garage”, “this”, “man”]) => True ● contains_vowel([“ffff”, “this”, “man”]) => False ● contains_vowel([]) => False Make sure your function handles any list of strings, and returns the appropriate response. There are no restrictions on the string or list methods that you can use. You may also write any helper functions if you choose.   The correctness tests total 24 points. Your function must be recursive in order to keep these correctness points. This means there should not be any loops in your solution.

In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.

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.

The MATLAB function arg supports variable arguments, returns the sum of the number of arguments and all arguments, and has a help function. Write the arg so that the next execution results.   >> help argIt supports variable arguments. >> [n,m] = arg(5,6)n =    2m =    11>> [n, m] = arg(3,4,5)n =   3m =   12

PHP Write a wordFilter function Write a function wordFilter($str) that takes a string representing a sentence as a parameter. It should replace all occurrences of certain blacklisted words with asterisks of the same length and return the substituted sentence. The words “shoot” “darn” and “fudge” (case insensitive) are considered blacklisted. However, these words as part of a larger word should be left alone (e.g. overshoot is fine as it is). Use one or more regular expressions with replacements in your solutions (e.g. preg_replace).

Write a one sentence description of this function and suggest a more descriptive name. int func1(double x) {return (int)(x + 0.5); }

Write a function filter_codes(list_codes) that receives a list of codes and returns another list containing those codes that:    Only have numeric characters; and Are at least 2 characters long; and At most 6 characters long Hint: remember that Python has a built-in function for determining if a string only contains numeric characters. solve using python