Starting out With Java $4$th Edition, Tony Gladdis$-$ Chapter $16$ Progamming Challenge $7-$ Search Benchmarks $($Would like the coding of this challenge with the added specifications without error if possible, thank you so much$)-$Name and submit your file SearchBenchmarking.

$-$SearchBenchmarking will at least have methods getData$(),$ sequentialSearch$(),$ binarySearch$(),$ and writeAnalysis$().$

$-$getData$()$ will fill an array of $50$ ints with unique random numbers between $1$ and $1000$ that are sorted.

$-$getData$()$ will print the resulting array with each value separated by a space$($s$),$ one row for each century and values aligned in columns, for partial example:

$243572100$

$141161194$

$321338347350$

$415$

$574577581586587$

$1000$

$-$sequentialSearch$()$ and binarySearch$()$ receive an array and a random int called target and returns the number of comparisons required to either find it or determine that it is not present.

$-$main$()$ will call getData$()$ and then repeatedly choose a random target from the range $[1..\mathrm{.}1000],$ call its two search algorithms, and print the results.

main$()$ will test the search algorithms $100$ times with new random values of target.

$-$An output table will be produced with column headings $$Target$,$Sequence$,$Binary$,$ and values aligned under them, for partial example:

Target Sequence Binary

$8569$

$542238$

$-$writeAnalysis$()$ will present overall information about the benchmarking exercise, including the average number of comparisons for each algorithm.