Consider the following Algorithms and answer the questions

Algorithm 1	int fun1(int n) { if (n <= 1) return n; return 2*fun1(n-1); }
Algorithm 2	int fun2(int n) { if (n <= 1) return n; return fun2(n-1) + fun2(n-1); }

• If n=8, what will be the final return value of both algorithms?
• Write both algorithms using loops strategy.

Answer rating: 100% (QA)

nt fun1int n if n 8 return n else return 2funn1 int main printfd fun2 return 0 output 32 This is the first time we are going to make an attempt to move backward in a program Loops make this backward m... View the full answer