代写 algorithm (1)Question 1:
• Show that if f(n) = O(f′(n)) and g(n) = O(g′(n)) then f(n) + g(n) =

(1)Question 1:
• Show that if f(n) = O(f′(n)) and g(n) = O(g′(n)) then f(n) + g(n) =
O(f′(n) + g′(n)).

(3)Question 3: Problem 13 (page 51): Provide an O(n log n) time algorithm.
(4)Question 4: Problem 37 (page 64).
Extra credit: Problem 26 (page 59): Hint, prove by induction that such tiling always exists (for n = 1, 2, . . .).