need process

10. Consider the recursive algorithm IFEELLIKESINGING, which takes as input an integer n 2 0: Algorithm IFeeLLIKESINGING(n): If n = 0 or n = 1 then sing O Canada else if n is odd then IFEELLIKESINGING(n1) else IFEELLIKESINGING(); FEELLIKESINGING -1) endif; endif If you run algorithm IFEELLIKESINGING(9), how many times do you sing O Canada? (a) 6 (b) 7 (c) 8 (d) 9