Describe the complexity of the following recursive algorithm with a recurrence equation and solve the recurrence equation. double algorithm(int n) { int sum = 0; k; if (n == 0) return 1; for (k = 0;k < n*n; k++) { sum++; } if (n % 3 == 0) return algorithm(n-1)*sum; else if (n % 3 == 1) return algorithm(n-1)/sum; else return algorithm(n-1) + sum; }