title: Comparing polynomial and exponential time complexity
body: <p>Can anybody please look at the image and tell me how the time is calculated for exponential algorithms i.e., 2^n and 3^n. 
  <img src="https://i.stack.imgur.com/DSMs1.png" alt="Comparing polynomial and exponential time complexity"></p>