Problem 2 130pts]. What are the time complexities of these methods? Briefly explain how you counted, for all cases. Be careful! a) int fun (int n) for (int = 1; 0; /-2) for (int5-o 3++ count 1 return counti