Back

Question: 2017 Fall 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 you run algorithm $\Hello(5)$, how many times is the word "hello" printed?
(a)
14
(b)
16
(c)
13
(d)
15