Write a program with at least 3 functions. One function can do a linear search on an array. The other can do a binary search. You will need to modify the binary search code to keep track of how many numbers it checked before it found the number.

Use function header/prototypes.

In main, make an array of 30 sorted numbers. (Initialize the array with the numbers.)

Do searches on the arrays on the same numbers. Print out how many elements it needs to check before it finds the number with each type of search.

Do at least 6 linear searches and 6 binary searches.