Part A (5 marks): Develop a recurrence relationship for the silly method that is called as follows: int result = silly (n); public static int silly (int n) { if (n <= 1) { return -100; } int sum = 0; for (int i = 0; i < n; i++) { sum += i; } return sum + silly (n-2); }

Part B (5 marks): What is the complexity of the following recurrence relation? Show the details of your analysis. T(1) = 1 T(n) = T(n-1) * n

Part C (5 marks): What is the complexity of the given method as a function n? Show all details of your analysis. public static int sumIt (int n) { int sum = 0; for (i=1; i<=n; i++) for (j=1; j<=n; j*=2) sum++; return sum; }