•• 7. It is a common error to to accidentally repeat a word. Write a program that reads a sentence, a word at a time, and removes any adjacent duplicates. The sentence ends when you read a word that ends in a period. The sentence will have at least two words. RemoveDuplicateWords.java 1 import java.util.Scanner; 2 3 public class RemoveDuplicatewords 4 { 5 public static void main(String[] args) Scanner in = new Scanner(System.in); String word = in.next(); 10 boolean done = false; 11 while (!done) 12 codecheck-bjlo-1e-04 19 String previous = in.next(); word = in.Hasnext(); if (word.endsWith(".")) { word = in.next(); done = true; } if (compare.wordWith(".")) { System.out.print(previous + 13 14 15 16 17 18 19 20 21 22 "); 23 24 } 25 System.out.print (word + "."); 26 27 } CodeCheck Reset Score: 0

Java please Input: Thxs xs thu yrxgxnwl   Thank you!

Write an application that counts by five from 5 through 500 inclusive, and that starts a new line after every multiple of 50 (50, 100, 150, and so on).   public class CountByFives {     public static void main (String args[]) {         // Write your code here     } }

public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string.This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is,str = new StringBuilder(str).reverse().toString();   Here's the tester it must pass: @Test public void testPancakeScramble() throws IOException {// Explicit test casesassertEquals("", P2J3.pancakeScramble(""));assertEquals("alu",…

Python Jupyter Notebook

def colours (guess tuple, hidden tuple) -> int: Preconditions: - guess is a sequence of four unique colours chosen from R, O, Y, G, B, V, - hidden is a sequence of four unique colours chosen from R, O, Y, G, B, V, Postconditions: output is number of correct colours in guess correct = 0 for colour in ('R','O','Y, 'G','B','V): if colour in guess and colour in hidden: correct = correct + 1 return correct colours (['R','B','O','G'],['R','B',V,'O']) Q1(a) What is the worst-case complexity of colours? What is the worst-case complexity of positions? Explain your answers.

public static int createMirror(String str) write your code to calculate the number of characters that should be removed from a string so that it becomes a mirrored word. dont use 3rd party libraries and java.util

A palindrome is a word or phrase that is identical when you read from forward or backward, such as the words “racecar” and “madam.” A standard palindrome is similar to a perfect palindrome, except that spaces and punctuation are ignored in a standard palindrome. For example, “Madam, I’m Adam” is a standard palindrome because the characters are identical forward or backward, provided you remove the spaces and punctuation marks. Write a PHP script that checks words or phrases stored in two separate string variables to determine if they are a perfect palindrome. In addition, see if you can modify the program to check for standard palindromes. create a web page with a text field and “Reset” and “Submit” buttons. When a user clicks on the submit button, show the standard and perfect palindromes of the string that was entered in the text field on the same page.  Create a separate Index.html and php file

A palindrome is a word or phrase that is identical when you read from forward or backward, such as the words “racecar” and “madam.” A standard palindrome is similar to a perfect palindrome, except that spaces and punctuation are ignored in a standard palindrome. For example, “Madam, I’m Adam” is a standard palindrome because the characters are identical forward or backward, provided you remove the spaces and punctuation marks. Write a PHP script that checks words or phrases stored in two separate string variables to determine if they are a perfect palindrome. In addition, see if you can modify the program to check for standard palindromes. create a web page with a text field and “Reset” and “Submit” buttons. When a user clicks on the submit button, show the standard and perfect palindromes of the string that was entered in the text field on the same page.

Please include a gui for the encryption and decryption java code. Example of the gui in the photos Java encryption and decryption code below import java.util.*; public class Main { //Inputs a one character string and returns True if the character is a letter (i.e. a to z or A to Z). Returns false if it is not. A function to check that the password or encryption key is valid. public static boolean isALetter(char letter){ if( (letter >= 'a' && letter = 'A' && letter =-32767 && encryptKey