Assume that each of the following expressions indicates the number of operations performed by an algorithm for a problem size of n . Point out the dominant term of each algorithm and use big-O...

Assume that each of the following expressions indicates the number of operations performed by an algorithm for a problem size of
n. Point out the dominant term of each algorithm and use big-O notation to classify it.

1. 2
   ⁿ
   
   
   – 4n
   ²
   + 5n
   


2. 3n
   
   ²
   
   + 6


3. 
   n
   
   ³
   
   +
   n
   
   ²
   
   –
   n