Technology, Algorithms.
actual values for n incrementally. Say we use 10 as n, and plug it into the above equations, 8¹⁰ will give us 1,073,741,824 and 4¹⁰ will give 1,048,576. This means 8^n will have a slower running time than 4^n and if we keep on increasing n, we will still notice the same pattern then we can say 8^n