Back

Question: 2017 Winter Midterm - 15

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