2) Discuss the following hypothesis: You cannot find two functions f ( n ) and g ( n ) where f ( n ) O ( g ( n )) as upper bound 3) Find time complexity of the following recurrence T ( n ) = 3 T ( n /4 ) + n 4) Find time complexity of the following recurrence T ( n ) = 8 T ( n /6 ) + n 5) Find time complexity of the following recurrence T ( n ) = 3 T ( 5 3 n ) + n.