Read the instructions and use Java code and Alogarithim

Objectives To implement interesting search algorithms To interpret specifications, and mathematical models To design an algorithm To implement the designed algorithm Instructions When an object does not occur in an array, a sequential search for it must examine the entire array. A ump search is an attempt to reduce the number of comparisons with the traditional sequential search. Instead of examining the n objects in the array a sequentially, you look at the elements a[j], a[2j], a[3j], and so on, for some positive j