find the solution f (n) when n = 2^k, where f(n) satisfies the recurrence relation f (n) = f (n/2) 3 with f (1) = 2.

The great thing about this problem is they give you everything you need to solve it easily. so the expression is: 12h+30w12h+30wand so everywhere you have an “h” you place 66. and everywhere you have a “w” you place 33. then the expression will look like this: 12(66)+30(33)12(66)+30(33)from here you multiply and then add. getting the following of: $785,862hope this