Revise LinearSearch.java listing 7.6, page 266 (name it LinearSearch2), to return the indexes of all duplicated target keys. Design the main method of your program such that it allows the user to re-run the program with different sets of inputs (i.e., use a loop). Document your code, and organize and space the outputs properly. Use escape characters and formatting objects when applicable.

A04.pti-Adobe Reeder dil Yiew Winduw Help Tools FIll&Sign Comment nearSearch2), to return the indexes of all duplicated target keys. Design the gram such that it allows the user to re-run the program with different sets of in cument your code, and organize and space the outputs properly. Use esc Export PDF Adobe ExportDf elec POF Fle Npm atting objects when applicable LISTING 7.6 LinearSearch.java nths of unlited tost to Ward omst 1 public class LinearSearch t 2/ The method for finding a key in the Tist 3 public static int 1inearSearch(int list, int key) f Coover for (inti-0; i