5. Write a recursive function f(n), which will display n-1 lines of "I like Alcorn" followed by "See you at Alcorn.' " F

[answerhappygod]

5. Write a recursive function f(n), which will display n-1 lines
of "I like Alcorn" followed by "See you at Alcorn.' " For example,
f(3) will display I like Alcorn I like Alcorn end (precondition: n
must be a positive integer.) 6. Do a big-O analysis of this
function: void print(n) { int i; int* p; P = new int(n); for (i =
1; i<=n; ¡=i+1) cin >> pli]; for (i = 1; i<=n; ¡=i+1)
cout «< p[il; Your analysis should show the procedure of how you
do the analysis in detail. At the end, give the big-O
value.