What does the following algorithm do? Procedure Guess (n: nonnegative integer) if n=0 return 1 else return (n-1) x Guess(n-2) The algorithm returns (n-1)!. The algorithm returns Fibonacci Sequence,

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 ***"

How many lines does the following program print, as a function

sum = 0 for j in range(1,12): sum = sum + (9*j + 3) print(sum) What is printed as a result of executing this algorithm?

(d) Write a C+ source code that accepts three numbers and prints "All numbers are equal" if all three numbers are equal, "All numbers are different" if all three numbers are different and "Neither all are equal or different" otherrwise. Test Data Input first number: 2564 Input second number: 3526 Input third number: 2456 Expected Output: All numbers are different