Statistics homework help

18] This is Big-Oh notation exercise. Using Java and the Eclipse IDE please help me with this exercise. 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.