8. search benchmarks write a program that has an array of at least 20 integers. it should call a function that uses the linear search algorithm to locate one of the values. the function should keep a count of the number of comparisons it makes until it finds the value. the program then should call a function that uses the binary search algorithm to locate the same value. it should also keep count of the number of comparisons it makes. display these values on the screen.