This Questions in design and analyze of algorithms

Exercise 1 (10 Points) Use the informal definitions of 0, and to determine whether the following assertions are true or false. a. n(n 1)/2 E O(n) c. n(n)/2 E (n) d, n(n + 1)/2 e (n) Exercise 2 (12 Points) Consider the following recursive algorithm ALGORITHM (n) Input: A positive integer n fn I return 1 else return Qn -1)+2*n-1 a. Set up a recurrence relation for this function's values and solve it to determine what this algorithm computes. b. Set up a recurrence relation for the number of multiplications made by this algorithm and solve it. c. Set up a recurrence relation for the number of additions/subtractions made by this algorithm and solve it