Problem 3.8. Consider an algorithm that takes a time in theta ( n^1g 3 ) to solve instances of size n. Is it correct to say that it takes a time in O( n^1.59)? ln ohm(n^1.59)? ln theta( n^1.59)? Justify your answers. (Note: 1g 3 approx. 1.58496...)

Problem 3.8 Consider analgorithm that takes a time in ein'R3) to solve instances of size n. Is it correct to say that it takes a time in O(n159)? In 1.59)? In O (n 1.59)? Justify your answers. (Note: lg3 1.58496