Question: 15. Consider the recursive algorithm HELLO, which takes as input an integer n 2 0: Algorithm HELLo(n): If n 0 or n 1 then print

15. Consider the recursive algorithm HELLO, which takes as input an integer n 2 0: Algorithm HELLo(n): If n 0 or n 1 then print hello else HELLO(n 1 print "hello" HELLO(n 2) endif If you run algorithm HELLO(5), how many times is the word "hello" printed? (a) 13 (b) 14 (c) 15 (d) 16
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
