Develop a recurrence relationship for the strange method that is called as follows:

Part A

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

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 C

int result = funny (n); public static int funny (int n) { if (n <= 1) { return -1; } int sum = funny (n-1) + funny (n-1) + n; return sum + n*funny (n/2); }

Please explain how to get time complexity for each code given.