title: Big Oh Notation Prove O(2^n)
body: <p>I am revising my old algorithm analysis notes for an interview, </p>
  
  <p>i noticed a question that i was not able to figure out when i was studying</p>
  
  <p><strong>prove that <code>2<sup>n+10</sup> + n = O(2<sup>n</sup>)</code></strong></p>
  
  <p>any help would be great!</p>