Searching and Sorting In An Integer List Add a method int

Searching and Sorting In An Integer List

1. Add a method int search(int target)to the IntegerList class that looks for value target in the list using a sequential (linear) search algorithm. Returns the index where it first appears if it is found, -1 otherwise. Use the code from the Searches.javafile as your guide.Add an option to the menu in IntegerListTest to test your new method.
2. Add a method void selectionSort() to the IntegerList class that sorts the lists into ascending order using the selection sort algorithm. Use the code from theSorts.javafile as your guide. Add an option to the menu in IntegerListTest to test your new method.
3. Add a methodvoid sortDecreasing()to the IntegerList class that sorts the list into decreasing (instead of increasing) order. Use the selection sort algorithm, but modify it to sort the other way. Be sure you change the variable names so they make sense! Add an option to the menu in IntegerListTest to test your new method.
4. Add a methodvoid replaceFirst(int oldVal, int newVal)to the IntegerList class that replaces the first occurrence of oldVal in the list with newVal. If oldVal does not appear in the list, it should do nothing (but it's not an error). If oldVal appears multiple times, only the first occurrence should be replaced. Note that you already have a method to find oldVal in the list; use it! Add an option to the menu in IntegerListTest to test your new method.
5. Add a methodvoid replaceAll(int oldVal, int newVal)to the IntegerList class that replaces all occurrences of oldVal in the list with newVal. If oldVal does not appear in the list, it should do nothing (but it's not an error). Does it still make sense to use the search method like you did for replaceFirst, or should you do your own searching here? Think about this. Add an option to the menu in IntegerListTest to test your new method.