Consider the algorithm below for checking whether a string represented in an array A of n characters is a palindrome. A palindrome is defined as a word that is spelled the same forward and backward (e.g. rotor, kayak). CHECK-PALINDROME (A[1: n]): 1. If n = 0 or n = 1, return True. 2. Otherwise, if A[1] = A[n] and CHECK-PALINDROME (A[2: n − 1)) returns True, return True. 3. Return False. We analyze CHECK-PALINDROME in this question. (a) Use induction to prove the correctness of this algorithm.

this should be done in C   Our method will involve analyzing a string and picking the 5 most common letters in that string. We will then compute how far each of these is from the letter ‘e’. We will then produce 5 possible decryptions of the string by: Decryption 1 will be from comparing how far the most popular letter is from the letter “e” Decryption 2 will be from comparing how far the second most popular letter is from the letter “e”  Decryption 3 will be from comparing how far the third most popular letter is from the letter “e” Decryption 4 will be from comparing how far the fourth most popular letter is from the letter “e” Decryption 5 will be from comparing how far the fifth most popular letter is from the letter “e”

Python

The factorial of a positive integer n —which we denote as n!—is the product of n and the factorial of n 1. The factorial of 0 is 1. Write two different recursive methods in Java that each return the factorial of n. Analyze your algorithm in Big-Oh notation and provide the appropriate analysis, ensuring that your program has a test class.

Write a program that computes the array B by computing the natural logarithm of all the elements of A whose value is no less than 1, and adding 20 to each element that is equal to or less than 1. Do this by using a for loop with conditional statements.

ghcvbcgvcghcfcfgfgcfhg gh g gbbbjh jhbjh

Given a string str and number n, write a program in JavaScript that recursively appends a copy of string str n times and returns the resulting string.

Given a string, write a method that returns the number of occurrences of substrings "baba" or "mama" in the input string recursively. They may overlap. Do not use any loops within your code. Do not use any regular expressions and methods such as matches, split, replaceAll. "Maa mana, Test case 1: countBabaMama ("aba babaa amama ma") 2 Test case 2: countBabaMama ("bababamamama") 4

The Problem The Mastermind game board game is a code breaking game with two players. One player (your program) becomes the codemaker, the other the codebreaker. The codemaker (your program) creates a 4 digit secret code which is randomly generated by the supplied code below and the codebreaker tries to guess the 4 digit pattern. import randomsecretCode =[]for i in range (0,4):    n = random.randint(1,9)    secretCode.append(str(n))    print (secretCode) # take this out when you are playing the game for real because it is a secret The secret code pattern generated above will consist of any of the digits 1-9 and can contain multiples of the same digit. Your program should then tells the codebreaker which digits should be in their guess by displaying a sorted list of the digit characters contained in the secret code python list . Use the loopfor digit in sorted(secretCode):    #display each digit on the same line for the player to see; there could be duplicate digits in the secret Prompt…