Given the following function f, written in pseudocode similar to C or Java:

void f(int n) { if (n==0) print("hello") else if (n==1) print ("hellohello") else { f(n-2) print("hellohellohello") f(n-2) } } 

= the number of hellos printed by f(n).

Analysis of Algorithm - Part 2 of 3: first 10 terms In the remaining questions you will use iteration to deduce an analytical solution for this sequence: In this question, please write out the first 10 terms (from 0 to 9 ) of the sequence hn. Show and keep the intermediate expansions because they will turn out to be more important than the final values for noticing a pattern (and your grade will depend on it). In other words: Do distribute your operations to remove the parentheses in each term of the sequence, but be very careful when calculating the results of additions, multiplications, and exponentiations, because the pattern will disappear if you go too far