Back

Question: 2017 Winter Final - 9

Author: Michiel Smid
Consider the recursive algorithm $\Hello$, which takes as input an integer $n \geq 0$: (see file for missing code) If we run algorithm $\Hello(7)$, how many times is the word "hello" printed?
(a)
10
(b)
11
(c)
12
(d)
9