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:
Suppose that you have a dictionary whose words are not sorted in alphabetical order. As a function of the number, n, of words, what is the time complexity of searching for a particular word in this dictionary?
(Show your work and all of the steps taken to determine the Big-Oh for each problem).