Write a C++ program that implements the following three algorithms and times for various values of n. The program should display a table of the run times of each algorithm for various values of n. //Algorithm C sum - n* (n + 1) / 2 //Algorithm A sum - 0; for (i = 1 to n) sum - sum + 1 //Algorithm B sum - 0; for (i - 1 to n) { for (j = 1 to i) sum - sum + i }

Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"

Write the recursive function based on the following formula in Visual Basic code: if n=0 f(n) = 1 if n = 1 F(n- 1) + F(n – 2) if n>1

In program C Write a recursive function find_sum(n)that calculates the sum of successive integers starting at 1and ending at n(i. e., find_sum( n) = 1 + 2 . . .+( n -1) + n.