Modern programming languages would automatically transform a non-tail-recursive function to its equivalent tail-recursive implementation or loop variant which is more efficient in terms of both space and time, compared to a non-tail-recursive equivalent function. Give explanations as to how space efficiency is obtained. Give explanations as to how time efficiency is obtained.

This is a MATLAB Coding problem: Implement a recursive function, called count, that takes two inputs, an array of integers and target integer. count should search the array for the target integer and return the number of occurrences of the target integer in the array. For example: disp(count([1, 2, 4, 1, 2, 1], 1)) % Generates 3disp(count([1, 2, 4, 1, 2, 1], 2)) % Generates 2disp(count([1, 2, 4, 1, 2, 1], 4)) % Generates 1disp(count([1, 2, 4, 1, 2, 1], 9000)) % Generates 0

Using any programming language, implement the Leibniz series; Leibniz( ) as a recursive function and interactive functions using both a for and while loop.

Given the recursive function definition:t(n) = n+ 3 * t(n-1) + t(n-2) t(0) = 2 t(1) = 1a. Evaluate: t(3)b. Write the source code to implement this function

Can you please help me solve problem 2?

In any CAS or programmng language

Translate the following subroutine written in C into ARMassembly code. The parameter x and y are passed to your procedure in register r0 and r1. Your procedureshould place the return value inregister r0. (Note: You must implement the recursive function as defined.) int fun(int x, int y) { if (y <= 0) return 1; else return x*fun(x, y-1); }

List and explain 3 reasons why recursive functions generally considered to be more inefficient compared to iterative methods?

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.

List three types of recursion to reach a termination of recursions with a high-level description and a specific algorithm falling into each type.

DO NOT COPY ANSWER FROM ANOTHER QUESTION LEAVE IF you cannot do it perfectly. Otherwise, I will not only DOWN the vote but also REPORT you to the official Chegg team.I won't stop calling Chegg until they really pay attention to this trash behavior. Write a structurally recursive function (prefix->postfix exp) that takes as input an expression in the same little language as Problem 4. prefix->postfix returns an expression of the same form as its input, except that all function applications have been reversed. Finish this Racket code below to answer the question above.(define prefix->postfix(lambda (exp)))

Recursion efficiency in Julia can be improved using memorization technique to store the values of previously computed functions. The following Fibonacci function below does not employ memorization, please change into a recursive function with memorization: function fib(n) if n==1 return 1 elseif n==2 return 1 elseif n<=0 printstyled("Invalid input",color=:red) return else return fib(n-1)+fib(n-2) end end

Answer the given question with a proper explanation and step-by-step solution.