Using Java and the Eclipse IDE please help me by providing a visual sample of this exercise. Please submit in a properly structured text file that I can follow and read to understand. Thank you.
Exercise:
Consider two programs, A and B. Program A requires 1000 × n2 operations and Program B requires 2n operations. For which values of n will Program A execute faster than Program B?
(Show your work and all of the steps taken to determine the Big-Oh for each problem).