(d) (10 Points) Use the master method to solve the following recurrence relation. T(n)=T(n/3)+1 [ANSWER] i. (2 Point) What is the value of a ? ii. (2 Point) What is the value of b ? iii. (2 Point) What is the value of d ? iv. (2 Points) What is the value of nd ? v. (2 Points) What is the Big-Oh? 7. (5 Points) True or False? (a) (3 Points) log2n+n(log2n)2=O(nlog2n) (b) (2 Points) n2log3n+n(log3n )2=O(n2log3) You don't need to show your work..