Can I get help in racket please.Please do not solve in any otherprograms/language.When writing the following recursive functions, use only car/first, cdr/rest and consfunctions. Do not use any built-in functions, except expt.4. Write a recursive function, sumofSqr, that that will return the sum of the squares of thefirst N natural numbers.(sumofSqr 3)(sumofSqr 10) ===> 385(sumofSqr 0)===> 14(12 + 22 + 32 )===> 05. Write a recursive function, mult5,at will return how many numbers in the list aremultiples of 5.(mult5 '(60 22 13 25) ===> 2(mult5 '(5) ===> 1(mult5 '()===> 06. Write a recursive function, getlast, that will return the last element in a list. If the list isempty, return the string "empty list".7. Write a recursive function, countdown, that takes any non-negative integer start as itsargument returns a list of all the positive integers less than or equal to start, indescending order:(countdown 5) ===> (5 4 32 1)(countdown 1) ===> (1)(countdown 0) ===> ()

For part a) I didn't have used any inbuilt function as it can be done logically. I have implemented…

4. Write a recursive function, sumofSqr, that that will return the sum of the squares of the first N natural numbers. (sumofSqr 3) (sumofSqr 10) ===> 385 (sumofSqr 0) ===> 14 ; (12 + 22 + 32 ) ===> 0 5. Write a recursive function, mult5, that will return how many numbers in the list are multiples of 5. (mult5 '(60 22 13 25) ===> 2 (mult5 (5) ===> 1 (mult5 '() ===> 0 6. Write a recursive function, getlast, that will return the last element in a list. If the list is empty, return the string "empty list".

4. Write a recursive function, sumofSqr, that that will return the sum of the squares of the first N natural numbers. (sumofSqr 3) (sumofSqr 10) ===> 385 (sumofSqr 0) ===> 14 ; (12 + 22 + 32 ) ===> 0 5. Write a recursive function, mult5, that will return how many numbers in the list are multiples of 5. (mult5 '(60 22 13 25) ===> 2 (mult5 (5) ===> 1 (mult5 '() ===> 0 6. Write a recursive function, getlast, that will return the last element in a list. If the list is empty, return the string "empty list".

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

is it possible to change this function from recursive to iterative one? Any help would be greatly appreciated.
Consider the recursive function provided above. After the initial call to the function ham has been made with argument 26 then how many subsequent recursive calls will be made before a value a final result can be returned? This question is internally recognized as variant 235. Q11) 1 2 3 4 5 6 7 8 none of the above
Please IN C++ Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Takes an array of integers and its size as input params and returns a bool such that 'true' ==> all elements of the array are prime, so the array is prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first executed statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last executed statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one other helper function (IsPrimeRecur) which…
Explain, in your own words, what happens in memory when a recursivefunction is used, and what types of disadvantages a recursive function bringswhen compared to a function that uses iteration.
Below,enter code to complete implementation of a recursive function sum_all_integers(), which takes an input n and adds all intergers preceding it, up to n: add_all_integers(n):
Consider the following function: void fun_with_recursion(int x) { printf("%i\n", x); fun_with_recursion(x + 1); } What will happen when this function is called by passing it the value 0?
Convert the following function into a recursive function
Write a recursive function, sumDigits, that takes an integer as a parameter and returns the sum of the digits of the integer. Also, write a program to test your function.
in kotlin, Write two versions of the recursive summation function (that is, take an int parameter n and calculate the sum of all integers from 1 to n). One version should use a block body, and the other should use an expression body. Test the functions using a main()