z

$($i$)$ Find the recurrence relation for the given pseudo code and calculate its time complexity using the

substitution method.

$($ii$)$ Verify the time complexity obtained with the substitution method using the recursion tree method.

Algorithm ALGBX $($ int n$)$

if$($n$>0)$

$\{$

for$(\}\backslash$textrm$\{$i$\}=1$;$\backslash$textrm$\{$itextrm$\{$n$\}$;$\backslash$textrm$\{$i$\}=\backslash$textrm$\{$i$\}++$

print$($n$)$;

ALGBX $($n$-1)$;

ALGBX $($n$-1)$;