number 8 Pseudo-Code (which also includes your algorithm), Java Doc(s) with an explanation of the Java Doc, all of which must be in correct format

use java language

pseudo should be in English language with algorithm.

sorting, searching, and Agorahm Analysn 7. search Benchmarks write an application that has an array of at east 20 integers. lt should call a method that uses the search a lgorithm to locate of The method keep a count of the should call another method makes until it finds the value. Then the program tha It should also keep count of the nary search algorithm to locate the same the screen, number of it makes Display these vames ns 8. Sorting Benchmarks Modify the methods presented in this chapter that perform the bubble sort, selection soet. insertion sort, and Quicks algorithms on an int array, such that each method keeps a or count of the number of swaps it makes Then, write an application that uses four identical arrays of at least 20 integers. should call each method on a different array, and display the number of exchanges made by each algorithm. 9. Efficient computation of Fibonacci Numbers for computing Modify the application in Code Listing 18 by replacing the recursive method Fibonacci terms with an iterative version and try to make it as efficient as possible. Modify the application so it outputs the elapsed time in both seconds and milliseconds. Finally, run the application and generate output showing the time required to compute the terms of the sequence in positions 45, 46, 47, 48, and 50. on the results. 49