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

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-1) + 1

Part C (5 marks): What is the complexity of the given code as a function of the problem size n? Show all details of your analysis. for (int i=0; i < n; i++) loops(i); public static void loops (int x) { if (x < 0) return; for (int i=0; i < x; i++) for (int j=0; j < x; j++) print (hi); }