In this exercise you will compare binary search and linear $($or sequential$)$ search.

We have included the algorithms for you, however right now the method returns the index value

where the number is found.

What you need to do in this problem is modify each method to instead return the number of times

each goes through the loop.

Then you can test out the results on lists of different sizes. We have provided a helper method to

generate a list of a certain size.

Be sure to test at least $5$ different size arrays!