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

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

Part C (5 marks): What is the complexity of the given method as a function of the problem size n? Show all details of your analysis. public static int count (int n) { if (n%2 == 0) return n; int i=0; while (i > 0) i--; return i; }