Answer Happy

Recurrence Relation Find the time taken of this algorithm using a tracing tree and substitution method public static void rec(int n) { if(n>1) { for(i=0; i<n; i++) { System.out.println(n); } rec(n-1); }