PYTHON Create a proof-of-concept Morse Code translation application. For 'proof-of-concept', a partial implementation is good enough. Rather than translating every Morse Code character, just a handful will do. Use the letters from your first name, all upper case. Note that Morse Code characters consist of one or more dots or dashes. For example, the Morse Code for 'S' is '...' and for 'O' is '---'. See https://morsecode.scphillips.com/translator.html (Links to an external site.) for more info on Morse code. Be sure to include header comments in each step! Step 1  In this step, you'll set up the logic to convert letters to Morse code.  Create an application that asks the user to enter an upper case letter.Use an if-elif construct to determine which letter was entered and store the appropriate Morse code string in a variable. If there is no match, set the variable to "Unknown".As an example, the Morse code for the letter 'S' is represented using a string of three periods, "...", for dot…

Assignment 4 In this assignment, you will implement your own interpreter pattern to check a given sentence complies with the sentence requirements given below. Your implementation make sure to do necessary corrections on the sentence. Sentence Requirements: • Every sentence starts with a capital letter. • No sentence can start with a number. • Every sentence ends with a period “.”. • No consecutive words can be same. An exemplary sentence and its corrected version: “ 1 this is is a a sample sentence” Corrected sentence: “This is a sample sentence.” Deliverable: Your Java source code with appropriate design and classes/interface(s).

Rewrite Exercise 3.4 using the following func tion to return the area of a pentagon: def area(s):

Write a program to build a calculator. Instead of a typical calculator which reads in-order expressions and evaluates them, build a calculator that takes in numbers and assigns the operations to yield the highest value expression. The current operations on the calculator only handle pairs of parentheses, and the operators for addition, subtraction, multiplication, and division. The calculator can rearrange the numbers if it helps find the optimal value. For example, the list:4.0 5.0 3.0 2.0 1.0using the calculator should find the optimal expression yielding the maximum value to be:4.0 * 5.0 * 3.0 * (2.0 + 1.0) = 180Input from the keyboard a list of up to 10 floating-point values from-100000.0to100000.0. Output to the screen a single floating-point value rounded to two decimal places representing the highest value expression that the calculator could create by inserting the symbols( ) + - * /into the given expression. Assume at least one number in the list and only the operators listed…

Correct answer will be upvoted else downvoted. Computer science.    You are given a positive integer x. Check whether the number x is representable as the amount of the solid shapes of two positive integers.    Officially, you really want to check in case there are two integers an and b (1≤a,b) to such an extent that a3+b3=x.    For instance, in the event that x=35, the numbers a=2 and b=3 are reasonable (23+33=8+27=35). In the event that x=4, no pair of numbers an and b is reasonable.    Input    The primary line contains one integer t (1≤t≤100) — the number of experiments. Then, at that point, t experiments follow.    Each experiment contains one integer x (1≤x≤1012).    Kindly note, that the input for some experiments will not squeeze into 32-cycle integer type, so you should use something like 64-bit integer type in your programming language.    Output    For each experiment, output on a different line:    "Indeed" in case x is representable as the amount of the 3D shapes of two…

Give edgeTo after B is visited. Format your answer as {A:?, B:?, C:?, D:?, E:?, F:?, G:?, S:-}.（(Hint: the first step of the algorithm is to visit S, which should change the entries for A and B in edgeTo and distTo. The second step is to visit B, which should change the entries for C and E)）Give distTo after B is visited. Format your answer as {A:?, B:?, C:?, D:?, E:?, F:?, G:?, S:0}.Give edgeTo after Djiksta's is finished. Format your answer as {A:?, B:?, C:?, D:?, E:?, F:?, G:?, S:-}.Give distTo after Dijkstra's is finished. Format your answer as {A:?, B:?, C:?, D:?, E:?, F:?, G:?, S:0}.

Correct answer will be upvoted else Multiple Downvoted. Computer science. trade it with the past character in the string (if it exists). This activity is addressed as L;    trade it with the following character in the string (if it exists). This activity is addressed as R;    consistently transform it to the past character in the letter set (b turns into a, c becomes b, etc; a turns into the k-th letter of the Latin letter set). This activity is addressed as D;    consistently transform it to the following character in the letter set (a becomes b, b becomes c, etc; the k-th letter of the Latin letters in order turns into a). This activity is addressed as U;    sit idle. This activity is addressed as 0.    For instance, assume the underlying string is test, k=20, and the succession of activities is URLD. Then, at that point, the string is changed as follows:    the main activity is U, so we change the underlined letter in test to the following one in the initial 20 Latin letters, which…

Write a program in java to check whether a string is a rotation of another. Take both string from user.

how to write a java program that determine if a string is a palidrome using a recursive method and a non-recursive method (ignore characters that are not letters). Then write a driver to test the two versions of the two methods. (A palindrome is a string that reads the same forward as well as backward. For example, “otto” and “never odd or even” are palindromes) (driver can be hard coded)