Using existing algorithms as building blocks for new algorithms has all the following benefits EXCEPT:

Answer the given question with a proper explanation and step-by-step solution. 3. Draw the recursion tree when n = 8, where n represents the length of the array, for the following recursive method:int sum(int[] array, int first, int last) {if (first == last)return array[first];int mid = (first + last) / 2;return sum(array, first, mid) + sum(array, mid + 1, last);} Determine a formula that counts the numbers of nodes in the recursion tree. What is the Big- for execution time? Determine a formula that expresses the height of the tree. What is the Big- for memory? Write an iterative solution for this same problem and compare its efficiency with this recursive solution. 4. Using the recursive method in problem 3 and assuming n is the length of the array. Modify the recursion tree from the previous problem to show the amount of work on each activation and the row sums. Determine the initial conditions and recurrence equation. Determine the critical exponent. Apply the Little…

10. write general plan for analyzing recursive algorithms.

While working with Recursion, why do we need a base case? What will happen if we remove it? Explain with example

USING SIMPLE JAVA CODE TAKE GIVEN CODE AND MODIFY MODIFY GIVEN CODE USING JAVA RECURSIVE ACTION DO THE SAME JOB BUT USING RECURSIVE ACTION INSTEAD OF RECURSIVE TASK SAMPLE CODE BELOW  ********************************************************************************************************* import java.util.concurrent.ExecutionException;import java.util.concurrent.ForkJoinPool;import java.util.concurrent.RecursiveTask; //replace with recursive action to do same job below// public class SumWithPool{    public static void main(String[] args) throws InterruptedException,       ExecutionException {       //get the number of avaialbe CPUs      int nThreads = Runtime.getRuntime().availableProcessors();      System.out.println("Available CPUs: " + nThreads);           //create an array of data     int n = 10; //initital data size         if(args.length > 0) // use the user given data size       n = Integer.parseInt(args[0]);     int[] numbers = new int[n];       for(int i = 0; i <…

Suggest one further small extension or improvement of your own to the modified flashcard program. Outline what the extension does and briefly say what additional sub-problem(s) would need to be added to the initial decomposition. Note that you are only required to describe your further extension and do not need to implement it in code. The maximum word count is 150 words, including the added sub-problem(s).

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.

define iteration.

Can you please also explain what are the differences between the two algorithms?

try to solve using PYTHON, make sure your code has the methods invoked and proper printing statements according to the tasks.Complete the following problem using concepts of RECURSION