Write a working function in Lisp: a function that takes one parameter that you can assume to be a symbol named after a day of the week (no need to check it), such as 'monday, and returns the symbol for the next day. For example, (next-day 'tuesday) should return the symbol 'wednesday. Implement this function with a complex conditional.

Write java function that takes three numbers and returns max from three using ternary operators Thanks in advance

Using c++ In main.cpp, complete the function RollSpecificNumber() that takes in three parameters: a GVDie object, an integer representing a desired face number of a die, and an integer representing the goal amount of times to roll the desired face number. The function RollSpecificNumber() then rolls the die until the desired face number is rolled the goal amount of times and returns the number of rolls required. Note: For testing purposes, the GVDie objects are created in the main() function using a pseudo-random number generator with a fixed seed value. The program used during development uses a seed value of 15, but when submitted, different seed values will be used for each test case. Refer to the textbook section on random numbers to learn more about pseudo-random numbers. Ex: If the GVDie objects are created with a seed value of 15 and the input of the program is: 3 20 the output is: It took 140 rolls to get a "3" 20 times. #include <iostream>#include "GVDie.h"using...

Write the function that takes three dimensions of a brick: height(a), width(b) and depth(c) and returns true if this brick can fit into a hole with the width (w) and height(h). Examples doesBrickFit(1, 1, 1, 1, 1) → true doesBrickFit(1, 2, 1, 1, 1) → true doesBrickFit(1, 2, 2, 1, 1) false Notes • You can turn the brick with any side towards the hole. • We assume that the brick fits if its sizes equal the ones of the hole (i.e. brick size should be less than or equal to the size of the hole, not strictly less). • You can't put a brick in at a non-orthogonal angle.

Write a recursive function definition in C that will calculate the sum of the first n odd integers (all odd integers between 1 and 2n - 1). This mathematical function is defined as: 2*n - 1 + oddSum(n - 1 ), It n 2 1, or oddsum(n) 0, It n ≤ 0 Add a main function to your program that tests your oddSum function with THREE different values of n. You don't need any input with scant for this - just put in three statements like this: printf( "oddsum (10) = %d\n" , oddsum (10) );

In Kotlin, Write and test a recursive function called harm with an expression body that takes an Int argument n and calculates the sum of 1/1 ... 1/n. For example, harm(3) should return about 1.833333333. You do not need to worry about integer division.

In Phython Language: The DNA of a living organism consists of a string of 4 different bases represented with letters A, T, G, C. The DNA has a double helix structure which means these bases are paired in the string. An A base is always paired with a T base molecule and a C base is always paired with G molecule. Write a function matchingPair that accepts a single strand of the DNA structure as a string parameter and produces the pairing strand as a result and returns it. Strings can be considered as list of characters. Therefore the subscript notation that we use for lists is acceptable for strings as well. For example to reach to the 4th character of a string variable mystring, you may use the notation mystring[3]. Write another function search that accepts a long and a short DNA strand as parameters. The function should return the index positions of the occurrences of the short strand in the long strand as a list. Test your functions by accepting a long strand of DNA to find the...

Write a simple Common Lisp function that converts temperature in Celsius to Fahrenheit and show how to correctly output it! Use temp-change as function name and c as the parameter!

Write a function in JAVA language that accepts three integer parameters and returns true if two or more of them (integers) have the same rightmost digit. The integers are non-negative. Inside the main function test the function for at least two test cases.

Write a program called p3.py 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 Example: #the word is kangaroo ________ k_______ ka______ kan_____ kang____ kanga___ kangar__ kangaro_ kangaroo

Write a function MaxMagnitude() with two integer input parameters that returns the largest magnitude value. Use the function in a program that takes two integer inputs, and outputs the largest magnitude value. Ex: If the inputs are: 5 7 the function returns: 7 Ex: If the inputs are: -8 -2 the function returns: -8 Note: The function does not just return the largest value, which for -8 -2 would be -2. Though not necessary, you may use the absolute-value built-in math function. #include <iostream>using namespace std; void MaxMagnitude(int userVal1, int userVal2) {if (abs(userVal1) > abs(userVal2)) {return userVal1;}else if (abs(userVal2) > abs(userVal1)) {return userVal2;}}/* Define your function here */ int main() { int userVal1;int userVal2;cin >> userVal1 >> userVal2;/* Type your code here. Your code must call the function. */ cout << MaxMagnitude(userVal1, userVal2) << endl;/* Type your code here */ return 0;} Please help me with this problem using...

Write a function called Divisors which takes an integer and print all its divisors on the screen. Write the main program to call Divisors function, with an integer x t be taken from the user. Example: if x = 20, then the divisors are: 1, 2, 4, 5, 10, 20.

Implement a function alterCase in Python that converts a word to "alterCase". Given a word, using any mix of upper and lower case letters, the function then returns the same word, except that the first letter is upper case, the second is lower case, and then cases of letters alternate throughout the rest of the word. >>> alterCase('apple')'ApPlE'