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. Test case 1: countBabaMama ("aba babaa amama ma") + 2 Test case 2: countBabaMama ("bababamamama") 4 ->

Computer Science Consider a look-up service for the television shows on a given date. A file contains information about these shows. Each show’s data appears on two lines. The first line gives the name of the station, the channel, the name of the show, and a rating. These entries are separated by tildes (~). The second line briefly describes the show. Write pseudocode for a method with the header public void readFile(Scanner data) to read the file into a dictionary that will be searched. Decide what data should be the search key and what should be the associated value. Design any classes needed for the key and the value. Write pseudocode for the method Do not write any code for the answer. Use UML, pseudocode, and written Description.

You're given a string of words. You need to find the word "Nemo", and return a string like this: "I found Nemo at [the order of the word you find Nemo]!". If you can't find Nemo, return "I can't find Nemo :(". Examples findNemo ("I am finding Nemo !") "I found Nemo a findNemo ("Nemo is me") → "I found Nemo at 1!" findNemo ("I Nemo am") → "I found Nemo at 2!" Ct

Print numbers 0, 1, 2, ..., userNum as shown, with each number indented by that number of spaces. For each printed line, print the leading spaces, then the number, and then a newline. Hint: Use i and j as loop variables (initialize i and j explicitly). Note: Avoid any other spaces like spaces after the printed number. import java.util.Scanner;public class NestedLoop {public static void main (String [] args) {Scanner scnr = new Scanner(System.in);int userNum;int i;int j; userNum = scnr.nextInt();

def findOccurrences(s, ch):     lst = []     for i in range(0, len(s)):         if a==s[i]:             lst.append(i)     return lst Use the code above instead of enumerate in the code posted below. n=int(input("Number of rounds of Hangman to be played:")) for i in range(0,n):     word = input("welcome!")     guesses = ''     turns = int(input("Enter the number of failed attempts allowed:")) def hangman(word):            secrete_word = "-" * len(word)     print(" the secrete word " + secrete_word)         user_input = input("Guess a letter: ")         if user_input in word:         occurences = findOccurrences(word, user_input)         for index in occurences:             secrete_word = secrete_word[:index] + user_input + secrete_word[index + 1:]         print(secrete_word)     else:         user_input = input("Sorry that letter was not found, please try again: ")   def findOccurrences(s, ch):     return [i for i, letter in enumerate(s) if letter == ch]  *** enumerate not discussed in…

Write a method that reverses a string. For example, 'java interview' becomes 'weivretni avaj'.

Write a program that reads a list of scores and then assigns grades *10.1 based on the foilowing scheme: The grade is A if score is >= best - 10. The grade is B if score is >= best- 20. The grade is C if score is >= best - 30. The grade is D if score is >= best - 40. The grade is F otherwise. Here is a sample run: Enter scores: 40 55 70 58 Student 0 score is 40 and grade is C Student 1 score is 55 and grade is B Student 2 score is 70 and grade is A Student 3 score is 58 and grade is B Enter

if strings are immutable, like in Java, we can assume that they have a static length  True  False