the answer is Java.util.scanner
Answer:
Big Oh notation is used to asymptotically bound the growth of running time above and below the constant factor.
Big Oh notation is used to describe time complexity, execution time of an algorithm.
Big Oh describes the worst case to describe time complexity.
For the equation; T(N) = 10000*N + 0.00001*N^3.
To calculate first of all discard all th constants.
And therefore; worst case is the O(N^3).
Since Greg wants to become an advertising and promotions manager, he needs to at least gain a (B) bachelor’s degree level of education, since generally, this educational background is expected from individuals who wishes to work in an entry-level position in the field of advertising.
One of the skills that he also needs to develop is (C) communication skills, because he would have to be able to communicate in both written and spoken to develop the advertisements according to the client’s desires.
