1, Find the computational complexity 0(f) of each of the following algorithm with respect to n. Note that your answer should be tight bounds and not Big O(f). Function mysteryl(n): a=0 for i = 1 to 2n: a +=i for i = to 5n: a +=i return a Function mystery2(n): a=0 for i=1 to n: for j = 1 to 2n for k=1 to n*n: a += 1 return a Function mystery3(n) a=0 for i=1 to n: b = 1 while 2^b <=n: a +=1 return a

Kara categorized her spending for this month into four categories: Rent, Food, Fun, and Other. The amounts she spent in each category are pictured here.Rent $528 Food $422 Fun $317 Other $633How much total money did Kara spend this month?

A company decides to change its floor plan from cubicle to open office. This will bring in a constant stream of $1,000 in extra income annually. If the company invests this extra income in an account that earns 2.5% continuously compounded interest for ten years, is it worth the change? The change in floor plan costs $7,000.

Please explain how to get to the answer in-depth and also help me master the concept for future problems.