Write a python program that contains a function called reveal_recursive() that takes a word (string) and the length of the word (int) as input and has the following functionality: 1. prints the word where all characters are replaced by underscores 2. continue to print the word revealing one character at a time. i.e., the second line printed should print the first character followed by “_”’s representing the rest of the word. (see example below) 3. the function should end after printing the entire word once. 4. This function should be recursive

Write these codes in c language please. Thank you in advance 1. Define a function PrintFeetInchShort(), with int parameters numFeet and numInches, that prints using ' and " shorthand. End with a newline. Remember that "\n" in a string literal starts a new line. Ex: PrintFeetInchShort(5, 8) prints:5' 8"   2. Write a function so that the main() code below can be replaced by the simpler code that calls function MphAndMinutesToMiles(). Original main(): int main(void) { double milesPerHour; double minutesTraveled; double hoursTraveled; double milesTraveled; scanf("%lf", &milesPerHour); scanf("%lf", &minutesTraveled); hoursTraveled = minutesTraveled / 60.0; milesTraveled = hoursTraveled * milesPerHour; printf("Miles: %lf\n", milesTraveled); return 0; }   3. Define stubs for the functions called by the below main(). Each stub should print "FIXME: Finish FunctionName()" followed by a newline, and should return -1. Example output:FIXME: Finish GetUserNum() FIXME: Finish GetUserNum()…

The Fibonacci algorithm is a famous mathematical function that allows us to create a sequence of numbers by adding together the two previous values. For example, we have the sequence:1, 1, 2, 3, 5, 8, 13, 21…Write your own recursive code to calculate the nth term in the sequence. You should accept a positive integer as an input, and output the nth term of the sequence.Once you have created your code, add comments describing how the code works, and the complexity of any code you have created.

please solve in python and give code. thankzz

‘Write a function nesting(), which takes an arbitrary number of parameters, and returns a list containing the arguments. Write another function unnesting(), which takes a list L as the parameter and retums a 1D list. Notice that, you should be able to use loops to solve thisproblem and should not use recursive functions (which we will not cover in this course). ‘Write assertions to test the two functions.For example nesting(1, nesting(2, 3, nesting(4, 5, [6])), [7, 8], 9)unnesting([1, [2, 3, [4, 5, [6]]], [7. 8], 9])   (1, [2, 3, [4, 5, [6]]], [7, 8], 9][1, 2,3, 4, 5, 6, 7, 8 9]

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 function to check three given integers and return their sum. However, If one of the values is the same as another of the values, then both the values are not counted in the sum. In Ruby language.

IN PYTHON, Using recursion: ask the user for the length of a square and the character they want to use. Draw the square (similar to mini assignment #15 in functions part 3). Once the user creates the square with their specification, ask them if they want it to be smaller or larger and how many times. Draw all the squares growing in size to the specified range.

in c++ please paste working code. the program should  Input- Julia Lucas Mia -1 With an expected output of-  Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia

use The C Programming Language Online Compile for Recamán's Sequence Implement this in a program. Write two functions, one for solving it iteratively, one for solving it recursively. Take two arguments from the command-line: an "i" or "r", and the term number (how many terms to print). Print out which method executed (was selected) and all the terms (and the number of terms).