Solution
= Solution
Positivity gives $\max\{f(n),g(n)\}\leq f(n)+g(n)$. Thus $h(n)\leq f(n)+g(n)$ for every positive $n$, meeting <big O notation> with constant $1$ and threshold $1$. \b[True: $h=O(f+g)$.]
= Solution
Positivity gives $\max\{f(n),g(n)\}\leq f(n)+g(n)$. Thus $h(n)\leq f(n)+g(n)$ for every positive $n$, meeting <big O notation> with constant $1$ and threshold $1$. \b[True: $h=O(f+g)$.]