I need help with my algorithms class assignment. My professor is not good at explaining so I don't know how to do the assignment. I don't even know what an answer for these types of questions look like. I don't even need all the answers I just need to know how to do these kind of problems. Thanks!\

Here's the assignment:

CPS-340, Assignment #3 10 points Due: 2/17 at start of class. Goal: To learn frequency counting (FC) and solving recurrence relations (RR). Constraints: . show a walk through/trace to discover the pattern in FC show repeated substitution steps in finding big-oh (O) for RR Turn-in: hand written solutions for the problems (use single side of a page, each page is numbered), stapled together with first page also identifies you (on top right corner). Statement: Context is analysis of code segments (C-style) and recurrence relations for recursive algorithms. Questions 1 to 7 relate to exact frequency count and not upper bound(s). Questions 8 to 10 relate to recurrence relations and upper bound(s). 01. for(i = 0; i 0; i--) st; find FC of st. 08. T(n) = { 1 for n = 0 or n = 1; T(n-1) + 1 for n> 1}; determine upper bound. 09. T(n) = (1 for n = 1; T(n/2) + 1 for n > 1); determine upper bound. 10. T(n) = { 1 for n = 1; 2T(n/2) + n for n> 1}; determine upper bound