Time complexity Calculation

A program with time complexity 4ⁿ is more complex than the program with time complexity 16*n¹⁶

For ex: Let n=1024 =2¹⁰

4ⁿ can be written as  2²ⁿ

and substituting n value in 2²ⁿ, we get

2^2*1024  =2²⁰⁴⁸

and substituting n value in 16*(1024)¹⁶, we get

2⁴ *(2¹⁰)¹⁶

= 2⁴ *2¹⁶⁰

⁼2¹⁶⁴

Hence for larger values of n, a program with time complexity 4ⁿ is more complex than the program with time complexity 16*n¹⁶

Time complexity of 4ⁿ+16*n¹⁶ would be O(2²ⁿ)