These are various quantities that will naturally come up throughout the semester in our analysis of varying data structures. You should use base 2 for each log and may assume that n is a power of 2. For each function fi through fo above, compute the closed form for the summation (a formula that is directly in terms of n) and fo(n) = (21 log(n) + log(n)) provide a tight Big-O bound for the formula (ie., Big-O). To compute the closed form of each summation, you must show all work as a step-by-step derivation using the rules below and how you applied the rules). You may only use the following rules: RI. tcs6 =c8 . R2. v6 +960) = 19) +44). 13. e= (j + )e, foris med RA. 46 = S4) E 40), for any & O exists)