This is a three-part question for Big-Oh Notation (Java). I am stuck with this part of my assignment, so please answer all parts to this question! Thank you!

Please show all work.

1 (a). Suppose a method foo2() has a run time-complexity of O(n log n), foo3() has a time-complexity of O(n). Consider the method

What is the time-complexity of foo1() in big-Oh notation?

(b). Find the dominating term (the fastest growing term) in each of the following algebraic expressions and then write it in big-oh notation. All logarithms are to the base 2.

(c). For the code segment below estimate the time-complexity in the big-oh notation.

public void foo1() For (int i-0;/