longest.py -> using sys.argv ●くろまる Create a program, longest.py, that has a function that takes one string argument and prints a sentence indicating the longest word in that string. If there is more than one word print only the first. Your print statement should read: "The longest word is x" Where x = the longest word. The word should be all lowercase.

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"

python Please Write a function that finds the number of occurrences of a specified character in a string using the following header: def count(str, c) ex: count("welcome", "e") returns 2.

// Write a function that takes 1 argument, a string. // It returns true if the string is a palindrome (the same forwards and backwards). // It returns false if the string is not a palindrome. const isPalindrome = (string) => { // your code here... // Examples isPalindrome("cat") // returns false //isPalindrome("level") // returns true }

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,

hideshow Write a function hideshow that accepts two string arguments, an input string and a masking string. The masking string is a string consisting of '0's and '1's that has the same length as the input string. The function then returns a new string that is the same as the input string, except that it is masked. That is, in any position where the masking string contains a '0' the input character is replaced by a '#', whereas if the masking string contains a '1', the character is unchanged. Sample usage:>>> hideshow('apple', '11001') 'ap##e'>>> hideshow('apple', '00000') '#####'>>> hideshow('apple', '11111') 'apple'>>> hideshow('abcdefghijklmnopqrstuvwxyz', 13*'01') '#b#d#f#h#j#1#n#p#r#t#v#x#z'>>> hideshow 'df###re##', '101010101' ) 'd#####e##'>>> hideshow( 'df###re%%', '101010101' )=='d#####e##' True

PART F: MIDDLE TWOGiven a string str, print out a string made of the middle two chars. Assume the string length is at least 2 and iseven.Methods to use: substring(), length()Testing cases: string => ri code => od Practice => ct ab => ab 0123456789 => 45

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.