Write a Python function to get a string made of the first 2 and the last 2 chars from a given string. If the string length is less than 2, return instead an empty string. For instance, it should return unrn for unicorn. Call that function and print its output.

IN JAVA Write a function that takes in user input as a string. For all characters which are numeric, double its value and, if it is two digits, then replace it with the sum of its digits (e.g., 6 → 12 → 3 whereas 3 → 6). For all characters which are in uppercase, replace it with lowercase. For all characters which are in lowercase, replace it with uppercase (e.g., m → M and N → n).  The program should keep asking the user to enter strings until they either enter ‘q’ or ‘Q’.

Write a python program and add a function named words_and_sents() to it. Thisfunction takes a string parameter called text. Your function should count and print thetotal number of words and sentences in the text. Assume that every word in the text is asubstring followed by a space character “ “. Also, assume that every sentence in the textis a string containing one or more words and must end with a “.” or “?” character. Finally,capitalize each sentence (i.e., convert the first letter to uppercase) and print them onseparate lines. See the sample output below.>>> text = "hello, here are some words. and some sentences. canyou count them.">>> words_and_sents(text)#sentences = 3, #words = 12Printing sentences:Hello, here are some words.And some sentences.Can you count them.

In Python IDLE: How would I write a function for the problem in the attached image?

Implement a Program that compresses strings in a simple way by counting repeated characters. The string aabcccccaa, for instance, would become a2blc5a3. Your function should return the original string if the "compressed" string did not end up being any smaller than the original string. You can assume that the string only contains characters in upper- and lowercase (a–z).

1. Consider the loop from Section 8.3 of your textbook. prefixes = 'JKLMNOPQ'suffix = 'ack' for letter in prefixes:     print(letter + suffix) Put this code into a Python script and run it. Notice that it prints the names "Oack" and "Qack". Modify the program so that it prints "Ouack" and "Quack" but leaves the other names the same. Include the modified Python code and the output in your submission. 2. Give at least three examples that show different features of string slices. Describe the feature illustrated by each example. Invent your own examples. Do not copy them for the textbook or any other source.     The code and its output must be explained technically. The explanation can be provided before or after the code, or in the form of comments within the code. For code modification type of questions, always mention or clearly highlight the part which is modified, along with the reason stated, as a code comment. The descriptive part of your response must be at least 200 words. If you…

Write a function countWords that accepts a single string as an argument. The function then returns adictionary that gives the frequencies of words in the string that start with a given letter. The functionshould not be case sensitive, and upper case letters counts should be returned using upper caseletters as keys. Use Python please

Write a program that does two string functions: capitalize the first word of a phrase, and reverse the letters of words in odd positions within the phrase.  For this program it is acceptable to let punctuation be part of the word.  Write a capitalizeWords() and a reverseOddWords() method and call them in a test program.  Make certain to properly handle empty phrases, phrases with one and two words, and phrases with greater than two words.   For example, if the original phrase were: Learning Java is fun!  Java is powerful and easy to use The capitalized version would be: Learning Java Is Fun!  Java Is Powerful And Easy To Use And with reversed odd words would be: gninraeL Java sI Fun!  avaJ Is lufrewoP And ysaE To esU

How to write a function in python where it takes a list of string s. Where s= ["hello","lazyness","polite","politness"]. The function takes the string s as input and returns a string that is the longest even length string that ends with "ness". But if there is no string that ends with "ness" then an empty string is returned.